TSTP Solution File: COL091-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL091-2 : TPTP v8.2.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : Mon May 20 19:03:13 EDT 2024
% Result : Unsatisfiable 0.22s 0.59s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 13 unt; 3 nHn; 35 RR)
% Number of literals : 66 ( 16 equ; 35 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 : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 72 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(k1_contractD_c1,negated_conjecture,
( r != comb_app(combK,X1)
| ~ member(pair(p,X1),contract) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k1_contractD_c1) ).
cnf(ap_contractE13,axiom,
( member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract)
| ~ ap_contractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE13) ).
cnf(ap_contractE15,axiom,
( X3 = comb_app(X1,ap_contractE_sk3q(X1,X2,X3))
| ~ ap_contractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE15) ).
cnf(k_contractE,axiom,
~ member(pair(combK,X1),contract),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_contractE) ).
cnf(ap_contractE10,axiom,
( member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract)
| ~ ap_contractE_c3(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE10) ).
cnf(k_app,axiom,
combK != comb_app(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_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/sandbox2/benchmark/theBenchmark.p',ap_contractE9) ).
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/sandbox2/benchmark/theBenchmark.p',ap_contractE1) ).
cnf(ap_contractE4,axiom,
( X1 = comb_app(combK,X3)
| ~ ap_contractE_c1(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE4) ).
cnf(k1_contractD_h1,hypothesis,
member(pair(comb_app(combK,p),r),contract),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k1_contractD_h1) ).
cnf(c_0_10,negated_conjecture,
( r != comb_app(combK,X1)
| ~ member(pair(p,X1),contract) ),
inference(fof_simplification,[status(thm)],[k1_contractD_c1]) ).
cnf(c_0_11,plain,
( member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract)
| ~ ap_contractE_c4(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_contractE13]) ).
cnf(c_0_12,negated_conjecture,
( r != comb_app(combK,X1)
| ~ member(pair(p,X1),contract) ),
c_0_10 ).
cnf(c_0_13,plain,
( member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract)
| ~ ap_contractE_c4(X1,X2,X3) ),
c_0_11 ).
cnf(c_0_14,plain,
( X3 = comb_app(X1,ap_contractE_sk3q(X1,X2,X3))
| ~ ap_contractE_c4(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_contractE15]) ).
cnf(c_0_15,plain,
~ member(pair(combK,X1),contract),
inference(fof_simplification,[status(thm)],[k_contractE]) ).
cnf(c_0_16,plain,
( member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract)
| ~ ap_contractE_c3(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_contractE10]) ).
cnf(c_0_17,plain,
combK != comb_app(X1,X2),
inference(fof_simplification,[status(thm)],[k_app]) ).
cnf(c_0_18,plain,
( X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3))
| ~ ap_contractE_c2(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_contractE9]) ).
cnf(c_0_19,negated_conjecture,
( comb_app(combK,ap_contractE_sk3q(X1,p,X2)) != r
| ~ ap_contractE_c4(X1,p,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
( X3 = comb_app(X1,ap_contractE_sk3q(X1,X2,X3))
| ~ ap_contractE_c4(X1,X2,X3) ),
c_0_14 ).
cnf(c_0_21,plain,
( 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) ),
inference(fof_simplification,[status(thm)],[ap_contractE1]) ).
cnf(c_0_22,plain,
~ member(pair(combK,X1),contract),
c_0_15 ).
cnf(c_0_23,plain,
( member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract)
| ~ ap_contractE_c3(X1,X2,X3) ),
c_0_16 ).
cnf(c_0_24,plain,
combK != comb_app(X1,X2),
c_0_17 ).
cnf(c_0_25,plain,
( X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3))
| ~ ap_contractE_c2(X1,X2,X3) ),
c_0_18 ).
cnf(c_0_26,plain,
( X1 = comb_app(combK,X3)
| ~ ap_contractE_c1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_contractE4]) ).
cnf(c_0_27,negated_conjecture,
~ ap_contractE_c4(combK,p,r),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_28,plain,
( 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) ),
c_0_21 ).
cnf(c_0_29,hypothesis,
member(pair(comb_app(combK,p),r),contract),
k1_contractD_h1 ).
cnf(c_0_30,plain,
~ ap_contractE_c3(combK,X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
~ ap_contractE_c2(combK,X1,X2),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_32,plain,
( X1 = comb_app(combK,X3)
| ~ ap_contractE_c1(X1,X2,X3) ),
c_0_26 ).
cnf(c_0_33,negated_conjecture,
ap_contractE_c1(combK,p,r),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]),c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COL091-2 : TPTP v8.2.0. Released v2.7.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n015.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat May 18 13:13:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.22/0.59 # Version: 3.1.0
% 0.22/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.59 # Starting sh5l with 300s (1) cores
% 0.22/0.59 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10621 completed with status 0
% 0.22/0.59 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.59 # No SInE strategy applied
% 0.22/0.59 # Search class: FGHSM-FFLS32-MFFFFFNN
% 0.22/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.59 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.59 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.59 # Starting sh5l with 136s (1) cores
% 0.22/0.59 # SAT001_MinMin_p005000_rr_RG with pid 10628 completed with status 0
% 0.22/0.59 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.59 # No SInE strategy applied
% 0.22/0.59 # Search class: FGHSM-FFLS32-MFFFFFNN
% 0.22/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.59 # Preprocessing time : 0.003 s
% 0.22/0.59 # Presaturation interreduction done
% 0.22/0.59
% 0.22/0.59 # Proof found!
% 0.22/0.59 # SZS status Unsatisfiable
% 0.22/0.59 # SZS output start CNFRefutation
% See solution above
% 0.22/0.59 # Parsed axioms : 175
% 0.22/0.59 # Removed by relevancy pruning/SinE : 0
% 0.22/0.59 # Initial clauses : 175
% 0.22/0.59 # Removed in clause preprocessing : 4
% 0.22/0.59 # Initial clauses in saturation : 171
% 0.22/0.59 # Processed clauses : 898
% 0.22/0.59 # ...of these trivial : 55
% 0.22/0.59 # ...subsumed : 337
% 0.22/0.59 # ...remaining for further processing : 506
% 0.22/0.59 # Other redundant clauses eliminated : 49
% 0.22/0.59 # Clauses deleted for lack of memory : 0
% 0.22/0.59 # Backward-subsumed : 3
% 0.22/0.59 # Backward-rewritten : 26
% 0.22/0.59 # Generated clauses : 2632
% 0.22/0.59 # ...of the previous two non-redundant : 2541
% 0.22/0.59 # ...aggressively subsumed : 0
% 0.22/0.59 # Contextual simplify-reflections : 0
% 0.22/0.59 # Paramodulations : 2571
% 0.22/0.59 # Factorizations : 0
% 0.22/0.59 # NegExts : 0
% 0.22/0.59 # Equation resolutions : 61
% 0.22/0.59 # Disequality decompositions : 0
% 0.22/0.59 # Total rewrite steps : 1298
% 0.22/0.59 # ...of those cached : 1253
% 0.22/0.59 # Propositional unsat checks : 0
% 0.22/0.59 # Propositional check models : 0
% 0.22/0.59 # Propositional check unsatisfiable : 0
% 0.22/0.59 # Propositional clauses : 0
% 0.22/0.59 # Propositional clauses after purity: 0
% 0.22/0.59 # Propositional unsat core size : 0
% 0.22/0.59 # Propositional preprocessing time : 0.000
% 0.22/0.59 # Propositional encoding time : 0.000
% 0.22/0.59 # Propositional solver time : 0.000
% 0.22/0.59 # Success case prop preproc time : 0.000
% 0.22/0.59 # Success case prop encoding time : 0.000
% 0.22/0.59 # Success case prop solver time : 0.000
% 0.22/0.59 # Current number of processed clauses : 309
% 0.22/0.59 # Positive orientable unit clauses : 39
% 0.22/0.59 # Positive unorientable unit clauses: 0
% 0.22/0.59 # Negative unit clauses : 72
% 0.22/0.59 # Non-unit-clauses : 198
% 0.22/0.59 # Current number of unprocessed clauses: 1880
% 0.22/0.59 # ...number of literals in the above : 3984
% 0.22/0.59 # Current number of archived formulas : 0
% 0.22/0.59 # Current number of archived clauses : 192
% 0.22/0.59 # Clause-clause subsumption calls (NU) : 11544
% 0.22/0.59 # Rec. Clause-clause subsumption calls : 9833
% 0.22/0.59 # Non-unit clause-clause subsumptions : 11
% 0.22/0.59 # Unit Clause-clause subsumption calls : 4485
% 0.22/0.59 # Rewrite failures with RHS unbound : 0
% 0.22/0.59 # BW rewrite match attempts : 33
% 0.22/0.59 # BW rewrite match successes : 18
% 0.22/0.59 # Condensation attempts : 0
% 0.22/0.59 # Condensation successes : 0
% 0.22/0.59 # Termbank termtop insertions : 32559
% 0.22/0.59 # Search garbage collected termcells : 341
% 0.22/0.59
% 0.22/0.59 # -------------------------------------------------
% 0.22/0.59 # User time : 0.067 s
% 0.22/0.59 # System time : 0.006 s
% 0.22/0.59 # Total time : 0.073 s
% 0.22/0.59 # Maximum resident set size: 2032 pages
% 0.22/0.59
% 0.22/0.59 # -------------------------------------------------
% 0.22/0.59 # User time : 0.294 s
% 0.22/0.59 # System time : 0.013 s
% 0.22/0.59 # Total time : 0.307 s
% 0.22/0.59 # Maximum resident set size: 1832 pages
% 0.22/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------