TSTP Solution File: COL093-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL093-2 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : Sat May 4 07:29:03 EDT 2024
% Result : Unsatisfiable 3.30s 1.02s
% Output : CNFRefutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 59 ( 12 unt; 7 nHn; 59 RR)
% Number of literals : 117 ( 28 equ; 55 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 110 ( 23 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(s_app,axiom,
combS != comb_app(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',s_app) ).
cnf(ap_parcontractE11,axiom,
( X1 = comb_app(comb_app(combS,ap_parcontractE_sk1p(X1,X2,X3)),ap_parcontractE_sk1q(X1,X2,X3))
| ~ ap_parcontractE_c3(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',ap_parcontractE11) ).
cnf(s_parcontractE2,axiom,
( X1 = combS
| ~ member(pair(combS,X1),parcontract) ),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',s_parcontractE2) ).
cnf(ap_parcontractE12,axiom,
( member(pair(X1,ap_parcontractE_sk2q(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',ap_parcontractE12) ).
cnf(ap_parcontractE1,axiom,
( ap_parcontractE_c1(X1,X2,X3)
| ap_parcontractE_c2(X1,X2,X3)
| ap_parcontractE_c3(X1,X2,X3)
| ap_parcontractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),parcontract) ),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',ap_parcontractE1) ).
cnf(s1_parcontractD_c1,negated_conjecture,
( r != comb_app(combS,X1)
| ~ member(pair(p,X1),parcontract) ),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',s1_parcontractD_c1) ).
cnf(ap_parcontractE13,axiom,
( member(pair(X2,ap_parcontractE_sk2s(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',ap_parcontractE13) ).
cnf(ap_parcontractE14,axiom,
( X3 = comb_app(ap_parcontractE_sk2q(X1,X2,X3),ap_parcontractE_sk2s(X1,X2,X3))
| ~ ap_parcontractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',ap_parcontractE14) ).
cnf(ap_parcontractE3,axiom,
( X3 = comb_app(X1,X2)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',ap_parcontractE3) ).
cnf(s1_parcontractD_h1,hypothesis,
member(pair(comb_app(combS,p),r),parcontract),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',s1_parcontractD_h1) ).
cnf(parcontract_intros1,axiom,
( member(pair(X1,X1),parcontract)
| ~ member(X1,comb) ),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',parcontract_intros1) ).
cnf(ap_parcontractE6,axiom,
( X1 = comb_app(combK,X3)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',ap_parcontractE6) ).
cnf(ap_E2,axiom,
( member(X2,comb)
| ~ member(comb_app(X1,X2),comb) ),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',ap_E2) ).
cnf(ap_parcontractE2,axiom,
( member(comb_app(X1,X2),comb)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',ap_parcontractE2) ).
cnf(ap_parcontractE4,axiom,
( member(X3,comb)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p',ap_parcontractE4) ).
cnf(c_0_15,plain,
combS != comb_app(X1,X2),
inference(fof_simplification,[status(thm)],[s_app]) ).
cnf(c_0_16,plain,
( X1 = comb_app(comb_app(combS,ap_parcontractE_sk1p(X1,X2,X3)),ap_parcontractE_sk1q(X1,X2,X3))
| ~ ap_parcontractE_c3(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE11]) ).
cnf(c_0_17,plain,
( X1 = combS
| ~ member(pair(combS,X1),parcontract) ),
inference(fof_simplification,[status(thm)],[s_parcontractE2]) ).
cnf(c_0_18,plain,
( member(pair(X1,ap_parcontractE_sk2q(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE12]) ).
cnf(c_0_19,plain,
( ap_parcontractE_c1(X1,X2,X3)
| ap_parcontractE_c2(X1,X2,X3)
| ap_parcontractE_c3(X1,X2,X3)
| ap_parcontractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),parcontract) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE1]) ).
cnf(c_0_20,plain,
combS != comb_app(X1,X2),
c_0_15 ).
cnf(c_0_21,plain,
( X1 = comb_app(comb_app(combS,ap_parcontractE_sk1p(X1,X2,X3)),ap_parcontractE_sk1q(X1,X2,X3))
| ~ ap_parcontractE_c3(X1,X2,X3) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
( r != comb_app(combS,X1)
| ~ member(pair(p,X1),parcontract) ),
inference(fof_simplification,[status(thm)],[s1_parcontractD_c1]) ).
cnf(c_0_23,plain,
( member(pair(X2,ap_parcontractE_sk2s(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE13]) ).
cnf(c_0_24,plain,
( X3 = comb_app(ap_parcontractE_sk2q(X1,X2,X3),ap_parcontractE_sk2s(X1,X2,X3))
| ~ ap_parcontractE_c4(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE14]) ).
cnf(c_0_25,plain,
( X1 = combS
| ~ member(pair(combS,X1),parcontract) ),
c_0_17 ).
cnf(c_0_26,plain,
( member(pair(X1,ap_parcontractE_sk2q(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
c_0_18 ).
cnf(c_0_27,plain,
( X3 = comb_app(X1,X2)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE3]) ).
cnf(c_0_28,plain,
( ap_parcontractE_c1(X1,X2,X3)
| ap_parcontractE_c2(X1,X2,X3)
| ap_parcontractE_c3(X1,X2,X3)
| ap_parcontractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),parcontract) ),
c_0_19 ).
cnf(c_0_29,hypothesis,
member(pair(comb_app(combS,p),r),parcontract),
s1_parcontractD_h1 ).
cnf(c_0_30,plain,
~ ap_parcontractE_c3(combS,X1,X2),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_31,negated_conjecture,
( r != comb_app(combS,X1)
| ~ member(pair(p,X1),parcontract) ),
c_0_22 ).
cnf(c_0_32,plain,
( member(pair(X2,ap_parcontractE_sk2s(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
c_0_23 ).
cnf(c_0_33,plain,
( X3 = comb_app(ap_parcontractE_sk2q(X1,X2,X3),ap_parcontractE_sk2s(X1,X2,X3))
| ~ ap_parcontractE_c4(X1,X2,X3) ),
c_0_24 ).
cnf(c_0_34,plain,
( ap_parcontractE_sk2q(combS,X1,X2) = combS
| ~ ap_parcontractE_c4(combS,X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,plain,
( X3 = comb_app(X1,X2)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
c_0_27 ).
cnf(c_0_36,hypothesis,
( ap_parcontractE_c4(combS,p,r)
| ap_parcontractE_c2(combS,p,r)
| ap_parcontractE_c1(combS,p,r) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( comb_app(combS,ap_parcontractE_sk2s(X1,p,X2)) != r
| ~ ap_parcontractE_c4(X1,p,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( comb_app(combS,ap_parcontractE_sk2s(combS,X1,X2)) = X2
| ~ ap_parcontractE_c4(combS,X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( member(pair(X1,X1),parcontract)
| ~ member(X1,comb) ),
inference(fof_simplification,[status(thm)],[parcontract_intros1]) ).
cnf(c_0_40,plain,
( X1 = comb_app(combK,X3)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE6]) ).
cnf(c_0_41,hypothesis,
( comb_app(combS,p) = r
| ap_parcontractE_c4(combS,p,r)
| ap_parcontractE_c2(combS,p,r) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
~ ap_parcontractE_c4(combS,p,r),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_43,plain,
( member(pair(X1,X1),parcontract)
| ~ member(X1,comb) ),
c_0_39 ).
cnf(c_0_44,plain,
( X1 = comb_app(combK,X3)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
c_0_40 ).
cnf(c_0_45,hypothesis,
( comb_app(combS,p) = r
| ap_parcontractE_c2(combS,p,r) ),
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( member(X2,comb)
| ~ member(comb_app(X1,X2),comb) ),
inference(fof_simplification,[status(thm)],[ap_E2]) ).
cnf(c_0_47,negated_conjecture,
( comb_app(combS,p) != r
| ~ member(p,comb) ),
inference(spm,[status(thm)],[c_0_31,c_0_43]) ).
cnf(c_0_48,hypothesis,
comb_app(combS,p) = r,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_20]) ).
cnf(c_0_49,plain,
( member(comb_app(X1,X2),comb)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE2]) ).
cnf(c_0_50,plain,
( member(X2,comb)
| ~ member(comb_app(X1,X2),comb) ),
c_0_46 ).
cnf(c_0_51,negated_conjecture,
~ member(p,comb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_52,plain,
( member(X3,comb)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE4]) ).
cnf(c_0_53,plain,
( member(comb_app(X1,X2),comb)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
c_0_49 ).
cnf(c_0_54,hypothesis,
( ap_parcontractE_c2(combS,p,r)
| ap_parcontractE_c1(combS,p,r) ),
inference(sr,[status(thm)],[c_0_36,c_0_42]) ).
cnf(c_0_55,hypothesis,
~ member(r,comb),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_48]),c_0_51]) ).
cnf(c_0_56,plain,
( member(X3,comb)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
c_0_52 ).
cnf(c_0_57,hypothesis,
ap_parcontractE_c2(combS,p,r),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_48]),c_0_55]) ).
cnf(c_0_58,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COL093-2 : TPTP v8.1.2. Released v2.7.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 11:41:58 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.KRGNIwXicc/E---3.1_11172.p
% 3.30/1.02 # Version: 3.1.0
% 3.30/1.02 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.30/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.30/1.02 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.30/1.02 # Starting new_bool_3 with 300s (1) cores
% 3.30/1.02 # Starting new_bool_1 with 300s (1) cores
% 3.30/1.02 # Starting sh5l with 300s (1) cores
% 3.30/1.02 # sh5l with pid 11283 completed with status 0
% 3.30/1.02 # Result found by sh5l
% 3.30/1.02 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.30/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.30/1.02 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.30/1.02 # Starting new_bool_3 with 300s (1) cores
% 3.30/1.02 # Starting new_bool_1 with 300s (1) cores
% 3.30/1.02 # Starting sh5l with 300s (1) cores
% 3.30/1.02 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.30/1.02 # Search class: FGHSF-FFMS32-MFFFFFNN
% 3.30/1.02 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.30/1.02 # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 3.30/1.02 # G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 11287 completed with status 0
% 3.30/1.02 # Result found by G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 3.30/1.02 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.30/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.30/1.02 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.30/1.02 # Starting new_bool_3 with 300s (1) cores
% 3.30/1.02 # Starting new_bool_1 with 300s (1) cores
% 3.30/1.02 # Starting sh5l with 300s (1) cores
% 3.30/1.02 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.30/1.02 # Search class: FGHSF-FFMS32-MFFFFFNN
% 3.30/1.02 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.30/1.02 # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 3.30/1.02 # Preprocessing time : 0.004 s
% 3.30/1.02 # Presaturation interreduction done
% 3.30/1.02
% 3.30/1.02 # Proof found!
% 3.30/1.02 # SZS status Unsatisfiable
% 3.30/1.02 # SZS output start CNFRefutation
% See solution above
% 3.30/1.02 # Parsed axioms : 197
% 3.30/1.02 # Removed by relevancy pruning/SinE : 139
% 3.30/1.02 # Initial clauses : 58
% 3.30/1.02 # Removed in clause preprocessing : 1
% 3.30/1.02 # Initial clauses in saturation : 57
% 3.30/1.02 # Processed clauses : 192
% 3.30/1.02 # ...of these trivial : 2
% 3.30/1.02 # ...subsumed : 15
% 3.30/1.02 # ...remaining for further processing : 175
% 3.30/1.02 # Other redundant clauses eliminated : 72
% 3.30/1.02 # Clauses deleted for lack of memory : 0
% 3.30/1.02 # Backward-subsumed : 2
% 3.30/1.02 # Backward-rewritten : 7
% 3.30/1.02 # Generated clauses : 371
% 3.30/1.02 # ...of the previous two non-redundant : 288
% 3.30/1.02 # ...aggressively subsumed : 0
% 3.30/1.02 # Contextual simplify-reflections : 0
% 3.30/1.02 # Paramodulations : 291
% 3.30/1.02 # Factorizations : 0
% 3.30/1.02 # NegExts : 0
% 3.30/1.02 # Equation resolutions : 76
% 3.30/1.02 # Disequality decompositions : 0
% 3.30/1.02 # Total rewrite steps : 29
% 3.30/1.02 # ...of those cached : 24
% 3.30/1.02 # Propositional unsat checks : 0
% 3.30/1.02 # Propositional check models : 0
% 3.30/1.02 # Propositional check unsatisfiable : 0
% 3.30/1.02 # Propositional clauses : 0
% 3.30/1.02 # Propositional clauses after purity: 0
% 3.30/1.02 # Propositional unsat core size : 0
% 3.30/1.02 # Propositional preprocessing time : 0.000
% 3.30/1.02 # Propositional encoding time : 0.000
% 3.30/1.02 # Propositional solver time : 0.000
% 3.30/1.02 # Success case prop preproc time : 0.000
% 3.30/1.02 # Success case prop encoding time : 0.000
% 3.30/1.02 # Success case prop solver time : 0.000
% 3.30/1.02 # Current number of processed clauses : 107
% 3.30/1.02 # Positive orientable unit clauses : 7
% 3.30/1.02 # Positive unorientable unit clauses: 0
% 3.30/1.02 # Negative unit clauses : 34
% 3.30/1.02 # Non-unit-clauses : 66
% 3.30/1.02 # Current number of unprocessed clauses: 202
% 3.30/1.02 # ...number of literals in the above : 764
% 3.30/1.02 # Current number of archived formulas : 0
% 3.30/1.02 # Current number of archived clauses : 68
% 3.30/1.02 # Clause-clause subsumption calls (NU) : 1092
% 3.30/1.02 # Rec. Clause-clause subsumption calls : 920
% 3.30/1.02 # Non-unit clause-clause subsumptions : 12
% 3.30/1.02 # Unit Clause-clause subsumption calls : 127
% 3.30/1.02 # Rewrite failures with RHS unbound : 0
% 3.30/1.02 # BW rewrite match attempts : 3
% 3.30/1.02 # BW rewrite match successes : 3
% 3.30/1.02 # Condensation attempts : 0
% 3.30/1.02 # Condensation successes : 0
% 3.30/1.02 # Termbank termtop insertions : 7353
% 3.30/1.02 # Search garbage collected termcells : 699
% 3.30/1.02
% 3.30/1.02 # -------------------------------------------------
% 3.30/1.02 # User time : 0.009 s
% 3.30/1.02 # System time : 0.006 s
% 3.30/1.02 # Total time : 0.015 s
% 3.30/1.02 # Maximum resident set size: 2040 pages
% 3.30/1.02
% 3.30/1.02 # -------------------------------------------------
% 3.30/1.02 # User time : 0.012 s
% 3.30/1.02 # System time : 0.009 s
% 3.30/1.02 # Total time : 0.021 s
% 3.30/1.02 # Maximum resident set size: 1852 pages
% 3.30/1.02 % E---3.1 exiting
%------------------------------------------------------------------------------