TSTP Solution File: COL089-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : COL089-1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 30 18:22:33 EDT 2023
% Result : Unsatisfiable 2.62s 2.73s
% Output : CNFRefutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 32
% Syntax : Number of formulae : 49 ( 13 unt; 21 typ; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 61 ( 32 ~; 29 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 13 >; 19 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 40 ( 6 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
combK: $i ).
tff(decl_23,type,
combS: $i ).
tff(decl_24,type,
comb_app: ( $i * $i ) > $i ).
tff(decl_25,type,
comb: $i ).
tff(decl_26,type,
member: ( $i * $i ) > $o ).
tff(decl_27,type,
pair: ( $i * $i ) > $i ).
tff(decl_28,type,
contract: $i ).
tff(decl_29,type,
rtrancl: $i > $i ).
tff(decl_30,type,
ap_contractE_c1: ( $i * $i * $i ) > $o ).
tff(decl_31,type,
ap_contractE_c2: ( $i * $i * $i ) > $o ).
tff(decl_32,type,
ap_contractE_c3: ( $i * $i * $i ) > $o ).
tff(decl_33,type,
ap_contractE_c4: ( $i * $i * $i ) > $o ).
tff(decl_34,type,
ap_contractE_sk1p: ( $i * $i * $i ) > $i ).
tff(decl_35,type,
ap_contractE_sk1q: ( $i * $i * $i ) > $i ).
tff(decl_36,type,
ap_contractE_sk2q: ( $i * $i * $i ) > $i ).
tff(decl_37,type,
ap_contractE_sk3q: ( $i * $i * $i ) > $i ).
tff(decl_38,type,
trans: $i > $o ).
tff(decl_39,type,
r: $i ).
tff(decl_40,type,
p: $i ).
tff(decl_41,type,
y: $i ).
tff(decl_42,type,
z: $i ).
cnf(reduction_rls_4,axiom,
( member(pair(comb_app(X3,X1),X4),rtrancl(contract))
| ~ member(pair(X1,X2),contract)
| ~ member(X3,comb)
| ~ member(pair(comb_app(X3,X2),X4),rtrancl(contract)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reduction_rls_4) ).
cnf(reduction_refl,axiom,
( member(pair(X1,X1),rtrancl(contract))
| ~ member(X1,comb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reduction_refl) ).
cnf(ap_E1,axiom,
( member(X1,comb)
| ~ member(comb_app(X1,X2),comb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_E1) ).
cnf(transD,axiom,
( member(pair(X2,X4),X1)
| ~ trans(X1)
| ~ member(pair(X2,X3),X1)
| ~ member(pair(X3,X4),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transD) ).
cnf(trans_rtrancl,axiom,
trans(rtrancl(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',trans_rtrancl) ).
cnf(ap_reduce2_2h5,hypothesis,
member(pair(comb_app(r,p),comb_app(r,y)),rtrancl(contract)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_reduce2_2h5) ).
cnf(ap_reduce2_2c1,negated_conjecture,
~ member(pair(comb_app(r,p),comb_app(r,z)),rtrancl(contract)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_reduce2_2c1) ).
cnf(ap_reduce2_2h4,hypothesis,
member(pair(y,z),contract),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_reduce2_2h4) ).
cnf(contract_combD2,axiom,
( member(X2,comb)
| ~ member(pair(X1,X2),contract) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',contract_combD2) ).
cnf(comb_intros3,axiom,
( member(comb_app(X1,X2),comb)
| ~ member(X1,comb)
| ~ member(X2,comb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',comb_intros3) ).
cnf(ap_reduce2_2h1,hypothesis,
member(r,comb),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_reduce2_2h1) ).
cnf(c_0_11,axiom,
( member(pair(comb_app(X3,X1),X4),rtrancl(contract))
| ~ member(pair(X1,X2),contract)
| ~ member(X3,comb)
| ~ member(pair(comb_app(X3,X2),X4),rtrancl(contract)) ),
reduction_rls_4 ).
cnf(c_0_12,axiom,
( member(pair(X1,X1),rtrancl(contract))
| ~ member(X1,comb) ),
reduction_refl ).
cnf(c_0_13,axiom,
( member(X1,comb)
| ~ member(comb_app(X1,X2),comb) ),
ap_E1 ).
cnf(c_0_14,axiom,
( member(pair(X2,X4),X1)
| ~ trans(X1)
| ~ member(pair(X2,X3),X1)
| ~ member(pair(X3,X4),X1) ),
transD ).
cnf(c_0_15,plain,
( member(pair(comb_app(X1,X2),comb_app(X1,X3)),rtrancl(contract))
| ~ member(pair(X2,X3),contract)
| ~ member(comb_app(X1,X3),comb) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_16,axiom,
trans(rtrancl(X1)),
trans_rtrancl ).
cnf(c_0_17,plain,
( member(pair(X1,comb_app(X2,X3)),rtrancl(contract))
| ~ member(pair(X1,comb_app(X2,X4)),rtrancl(contract))
| ~ member(pair(X4,X3),contract)
| ~ member(comb_app(X2,X3),comb) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_18,hypothesis,
member(pair(comb_app(r,p),comb_app(r,y)),rtrancl(contract)),
ap_reduce2_2h5 ).
cnf(c_0_19,negated_conjecture,
~ member(pair(comb_app(r,p),comb_app(r,z)),rtrancl(contract)),
ap_reduce2_2c1 ).
cnf(c_0_20,hypothesis,
( member(pair(comb_app(r,p),comb_app(r,X1)),rtrancl(contract))
| ~ member(pair(y,X1),contract)
| ~ member(comb_app(r,X1),comb) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,hypothesis,
member(pair(y,z),contract),
ap_reduce2_2h4 ).
cnf(c_0_22,axiom,
( member(X2,comb)
| ~ member(pair(X1,X2),contract) ),
contract_combD2 ).
cnf(c_0_23,negated_conjecture,
~ member(comb_app(r,z),comb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,axiom,
( member(comb_app(X1,X2),comb)
| ~ member(X1,comb)
| ~ member(X2,comb) ),
comb_intros3 ).
cnf(c_0_25,hypothesis,
member(z,comb),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_26,hypothesis,
member(r,comb),
ap_reduce2_2h1 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.17 % Problem : COL089-1 : TPTP v8.1.2. Released v2.7.0.
% 0.10/0.17 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.17/0.40 % Computer : n024.cluster.edu
% 0.17/0.40 % Model : x86_64 x86_64
% 0.17/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.40 % Memory : 8042.1875MB
% 0.17/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.40 % CPULimit : 300
% 0.17/0.40 % WCLimit : 300
% 0.17/0.40 % DateTime : Sun Aug 27 04:25:09 EDT 2023
% 0.17/0.40 % CPUTime :
% 0.25/0.57 start to proof: theBenchmark
% 2.62/2.73 % Version : CSE_E---1.5
% 2.62/2.73 % Problem : theBenchmark.p
% 2.62/2.73 % Proof found
% 2.62/2.73 % SZS status Theorem for theBenchmark.p
% 2.62/2.73 % SZS output start Proof
% See solution above
% 2.62/2.74 % Total time : 2.156000 s
% 2.62/2.74 % SZS output end Proof
% 2.62/2.74 % Total time : 2.160000 s
%------------------------------------------------------------------------------