TSTP Solution File: COL090-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : COL090-2 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n007.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 3.84s 4.01s
% Output : CNFRefutation 3.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 93
% Syntax : Number of formulae : 118 ( 18 unt; 82 typ; 0 def)
% Number of atoms : 62 ( 17 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 58 ( 32 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 164 ( 75 >; 89 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-8 aty)
% Number of functors : 70 ( 70 usr; 7 con; 0-4 aty)
% Number of variables : 69 ( 27 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
cons: ( $i * $i ) > $i ).
tff(decl_23,type,
member: ( $i * $i ) > $o ).
tff(decl_24,type,
nat: $i ).
tff(decl_25,type,
succ: $i > $i ).
tff(decl_26,type,
inr: $i > $i ).
tff(decl_27,type,
inl: $i > $i ).
tff(decl_28,type,
disjsum: ( $i * $i ) > $i ).
tff(decl_29,type,
cons_subsetI_sk1: ( $i * $i * $i ) > $i ).
tff(decl_30,type,
subset: ( $i * $i ) > $o ).
tff(decl_31,type,
pair: ( $i * $i ) > $i ).
tff(decl_32,type,
converse: $i > $i ).
tff(decl_33,type,
eptset: $i ).
tff(decl_34,type,
diff: ( $i * $i ) > $i ).
tff(decl_35,type,
int: ( $i * $i ) > $i ).
tff(decl_36,type,
un: ( $i * $i ) > $i ).
tff(decl_37,type,
powI_sk1: ( $i * $i ) > $i ).
tff(decl_38,type,
pow: $i > $i ).
tff(decl_39,type,
interI_sk1: ( $i * $i ) > $i ).
tff(decl_40,type,
inter: $i > $i ).
tff(decl_41,type,
card_Union_sk1: $i > $i ).
tff(decl_42,type,
union: $i > $i ).
tff(decl_43,type,
card: $i > $o ).
tff(decl_44,type,
fin: $i > $i ).
tff(decl_45,type,
order_Inter_sk1: $i > $i ).
tff(decl_46,type,
ord: $i > $o ).
tff(decl_47,type,
order_Union_sk1: $i > $i ).
tff(decl_48,type,
comp: ( $i * $i ) > $i ).
tff(decl_49,type,
vimage: ( $i * $i ) > $i ).
tff(decl_50,type,
image: ( $i * $i ) > $i ).
tff(decl_51,type,
qInr: $i > $i ).
tff(decl_52,type,
qInl: $i > $i ).
tff(decl_53,type,
qsum: ( $i * $i ) > $i ).
tff(decl_54,type,
qsumE_sk1: ( $i * $i * $i ) > $i ).
tff(decl_55,type,
qsumE_sk2: ( $i * $i * $i ) > $i ).
tff(decl_56,type,
qconverse: $i > $i ).
tff(decl_57,type,
qconverseE_sk2: ( $i * $i ) > $i ).
tff(decl_58,type,
qconverseE_sk1: ( $i * $i ) > $i ).
tff(decl_59,type,
qPair: ( $i * $i ) > $i ).
tff(decl_60,type,
rmult: ( $i * $i * $i * $i ) > $i ).
tff(decl_61,type,
rmultE_c1: ( $i * $i * $i * $i * $i * $i * $i * $i ) > $o ).
tff(decl_62,type,
rmultE_c2: ( $i * $i * $i * $i * $i * $i * $i * $i ) > $o ).
tff(decl_63,type,
radd: ( $i * $i * $i * $i ) > $i ).
tff(decl_64,type,
le: ( $i * $i ) > $o ).
tff(decl_65,type,
lt: ( $i * $i ) > $o ).
tff(decl_66,type,
memrel: $i > $i ).
tff(decl_67,type,
compE_sk1: ( $i * $i * $i ) > $i ).
tff(decl_68,type,
compE_sk3: ( $i * $i * $i ) > $i ).
tff(decl_69,type,
compE_sk2: ( $i * $i * $i ) > $i ).
tff(decl_70,type,
id: $i > $i ).
tff(decl_71,type,
idE_sk1: ( $i * $i ) > $i ).
tff(decl_72,type,
sumE_sk1: ( $i * $i * $i ) > $i ).
tff(decl_73,type,
sumE_sk2: ( $i * $i * $i ) > $i ).
tff(decl_74,type,
vimageE_sk1: ( $i * $i * $i ) > $i ).
tff(decl_75,type,
imageE_sk1: ( $i * $i * $i ) > $i ).
tff(decl_76,type,
field: $i > $i ).
tff(decl_77,type,
fieldE_sk1: ( $i * $i ) > $i ).
tff(decl_78,type,
fieldE_sk2: ( $i * $i ) > $i ).
tff(decl_79,type,
range: $i > $i ).
tff(decl_80,type,
rangeE_sk1: ( $i * $i ) > $i ).
tff(decl_81,type,
domain: $i > $i ).
tff(decl_82,type,
domainE_sk1: ( $i * $i ) > $i ).
tff(decl_83,type,
cons_subsetE_sk1: ( $i * $i * $i ) > $i ).
tff(decl_84,type,
converseE_sk2: ( $i * $i ) > $i ).
tff(decl_85,type,
converseE_sk1: ( $i * $i ) > $i ).
tff(decl_86,type,
unionE_sk1: ( $i * $i ) > $i ).
tff(decl_87,type,
subsetD_sk1: ( $i * $i * $i ) > $i ).
tff(decl_88,type,
subsetI_sk1: ( $i * $i ) > $i ).
tff(decl_89,type,
combK: $i ).
tff(decl_90,type,
combS: $i ).
tff(decl_91,type,
comb_app: ( $i * $i ) > $i ).
tff(decl_92,type,
comb: $i ).
tff(decl_93,type,
contract: $i ).
tff(decl_94,type,
rtrancl: $i > $i ).
tff(decl_95,type,
ap_contractE_c1: ( $i * $i * $i ) > $o ).
tff(decl_96,type,
ap_contractE_c2: ( $i * $i * $i ) > $o ).
tff(decl_97,type,
ap_contractE_c3: ( $i * $i * $i ) > $o ).
tff(decl_98,type,
ap_contractE_c4: ( $i * $i * $i ) > $o ).
tff(decl_99,type,
ap_contractE_sk1p: ( $i * $i * $i ) > $i ).
tff(decl_100,type,
ap_contractE_sk1q: ( $i * $i * $i ) > $i ).
tff(decl_101,type,
ap_contractE_sk2q: ( $i * $i * $i ) > $i ).
tff(decl_102,type,
ap_contractE_sk3q: ( $i * $i * $i ) > $i ).
tff(decl_103,type,
r: $i ).
cnf(k_contractE,axiom,
~ member(pair(combK,X1),contract),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_contractE) ).
cnf(ap_contractE13,axiom,
( member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract)
| ~ ap_contractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE13) ).
cnf(s_contractE,axiom,
~ member(pair(combS,X1),contract),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_contractE) ).
cnf(ap_contractE10,axiom,
( member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract)
| ~ ap_contractE_c3(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE10) ).
cnf(ap_contractE1,axiom,
( ap_contractE_c1(X1,X2,X3)
| ap_contractE_c2(X1,X2,X3)
| ap_contractE_c3(X1,X2,X3)
| ap_contractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),contract) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE1) ).
cnf(s_app,axiom,
combS != comb_app(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_app) ).
cnf(ap_contractE9,axiom,
( X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3))
| ~ ap_contractE_c2(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE9) ).
cnf(ap_contractE4,axiom,
( X1 = comb_app(combK,X3)
| ~ ap_contractE_c1(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE4) ).
cnf(app_app1,axiom,
( X1 = X3
| comb_app(X1,X2) != comb_app(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',app_app1) ).
cnf(i_contract_E,negated_conjecture,
member(pair(comb_app(comb_app(combS,combK),combK),r),contract),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',i_contract_E) ).
cnf(k_s,axiom,
combK != combS,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_s) ).
cnf(c_0_11,axiom,
~ member(pair(combK,X1),contract),
k_contractE ).
cnf(c_0_12,axiom,
( member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract)
| ~ ap_contractE_c4(X1,X2,X3) ),
ap_contractE13 ).
cnf(c_0_13,axiom,
~ member(pair(combS,X1),contract),
s_contractE ).
cnf(c_0_14,axiom,
( member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract)
| ~ ap_contractE_c3(X1,X2,X3) ),
ap_contractE10 ).
cnf(c_0_15,plain,
~ ap_contractE_c4(X1,combK,X2),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
( ap_contractE_c1(X1,X2,X3)
| ap_contractE_c2(X1,X2,X3)
| ap_contractE_c3(X1,X2,X3)
| ap_contractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),contract) ),
ap_contractE1 ).
cnf(c_0_17,axiom,
combS != comb_app(X1,X2),
s_app ).
cnf(c_0_18,axiom,
( X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3))
| ~ ap_contractE_c2(X1,X2,X3) ),
ap_contractE9 ).
cnf(c_0_19,plain,
~ ap_contractE_c3(combS,X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( ap_contractE_c3(X1,combK,X2)
| ap_contractE_c2(X1,combK,X2)
| ap_contractE_c1(X1,combK,X2)
| ~ member(pair(comb_app(X1,combK),X2),contract) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
~ ap_contractE_c2(combS,X1,X2),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_22,axiom,
( X1 = comb_app(combK,X3)
| ~ ap_contractE_c1(X1,X2,X3) ),
ap_contractE4 ).
cnf(c_0_23,plain,
( ap_contractE_c1(combS,combK,X1)
| ~ member(pair(comb_app(combS,combK),X1),contract) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,axiom,
( X1 = X3
| comb_app(X1,X2) != comb_app(X3,X4) ),
app_app1 ).
cnf(c_0_25,plain,
~ member(pair(comb_app(combS,combK),X1),contract),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17]) ).
cnf(c_0_26,plain,
( comb_app(combS,ap_contractE_sk1p(comb_app(X1,X2),X3,X4)) = X1
| ~ ap_contractE_c2(comb_app(X1,X2),X3,X4) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_18])]) ).
cnf(c_0_27,plain,
~ ap_contractE_c3(comb_app(combS,combK),X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_14]) ).
cnf(c_0_28,plain,
~ ap_contractE_c2(comb_app(combS,X1),X2,X3),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_26])]) ).
cnf(c_0_29,plain,
( ap_contractE_c1(comb_app(combS,combK),combK,X1)
| ~ member(pair(comb_app(comb_app(combS,combK),combK),X1),contract) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_28]) ).
cnf(c_0_30,plain,
( comb_app(combS,combK) = comb_app(combK,X1)
| ~ member(pair(comb_app(comb_app(combS,combK),combK),X1),contract) ),
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
member(pair(comb_app(comb_app(combS,combK),combK),r),contract),
i_contract_E ).
cnf(c_0_32,negated_conjecture,
comb_app(combS,combK) = comb_app(combK,r),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( combS = X1
| comb_app(combK,r) != comb_app(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
cnf(c_0_34,axiom,
combK != combS,
k_s ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COL090-2 : TPTP v8.1.2. Released v2.7.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Aug 27 04:02:57 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 3.84/4.01 % Version : CSE_E---1.5
% 3.84/4.01 % Problem : theBenchmark.p
% 3.84/4.01 % Proof found
% 3.84/4.01 % SZS status Theorem for theBenchmark.p
% 3.84/4.01 % SZS output start Proof
% See solution above
% 3.84/4.02 % Total time : 3.433000 s
% 3.84/4.02 % SZS output end Proof
% 3.84/4.02 % Total time : 3.439000 s
%------------------------------------------------------------------------------