TSTP Solution File: COL088-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL088-2 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:28:17 EDT 2024
% Result : Unsatisfiable 192.03s 24.86s
% Output : CNFRefutation 192.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 14 unt; 0 nHn; 33 RR)
% Number of literals : 75 ( 0 equ; 44 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 55 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(reduction_rls_3,axiom,
( member(pair(comb_app(X1,X3),X4),rtrancl(contract))
| ~ member(pair(X1,X2),contract)
| ~ member(X3,comb)
| ~ member(pair(comb_app(X2,X3),X4),rtrancl(contract)) ),
file('/export/starexec/sandbox/tmp/tmp.QdXNauElWR/E---3.1_32375.p',reduction_rls_3) ).
cnf(reduction_refl,axiom,
( member(pair(X1,X1),rtrancl(contract))
| ~ member(X1,comb) ),
file('/export/starexec/sandbox/tmp/tmp.QdXNauElWR/E---3.1_32375.p',reduction_refl) ).
cnf(ap_E2,axiom,
( member(X2,comb)
| ~ member(comb_app(X1,X2),comb) ),
file('/export/starexec/sandbox/tmp/tmp.QdXNauElWR/E---3.1_32375.p',ap_E2) ).
cnf(transD,axiom,
( member(pair(X2,X4),X1)
| ~ trans(X1)
| ~ member(pair(X2,X3),X1)
| ~ member(pair(X3,X4),X1) ),
file('/export/starexec/sandbox/tmp/tmp.QdXNauElWR/E---3.1_32375.p',transD) ).
cnf(trans_rtrancl,axiom,
trans(rtrancl(X1)),
file('/export/starexec/sandbox/tmp/tmp.QdXNauElWR/E---3.1_32375.p',trans_rtrancl) ).
cnf(ap_reduce1_2c1,negated_conjecture,
~ member(pair(comb_app(p,r),comb_app(z,r)),rtrancl(contract)),
file('/export/starexec/sandbox/tmp/tmp.QdXNauElWR/E---3.1_32375.p',ap_reduce1_2c1) ).
cnf(ap_reduce1_2h5,hypothesis,
member(pair(comb_app(p,r),comb_app(y,r)),rtrancl(contract)),
file('/export/starexec/sandbox/tmp/tmp.QdXNauElWR/E---3.1_32375.p',ap_reduce1_2h5) ).
cnf(contract_combD2,axiom,
( member(X2,comb)
| ~ member(pair(X1,X2),contract) ),
file('/export/starexec/sandbox/tmp/tmp.QdXNauElWR/E---3.1_32375.p',contract_combD2) ).
cnf(ap_reduce1_2h4,hypothesis,
member(pair(y,z),contract),
file('/export/starexec/sandbox/tmp/tmp.QdXNauElWR/E---3.1_32375.p',ap_reduce1_2h4) ).
cnf(comb_intros3,axiom,
( member(comb_app(X1,X2),comb)
| ~ member(X1,comb)
| ~ member(X2,comb) ),
file('/export/starexec/sandbox/tmp/tmp.QdXNauElWR/E---3.1_32375.p',comb_intros3) ).
cnf(ap_reduce1_2h1,hypothesis,
member(r,comb),
file('/export/starexec/sandbox/tmp/tmp.QdXNauElWR/E---3.1_32375.p',ap_reduce1_2h1) ).
cnf(c_0_11,plain,
( member(pair(comb_app(X1,X3),X4),rtrancl(contract))
| ~ member(pair(X1,X2),contract)
| ~ member(X3,comb)
| ~ member(pair(comb_app(X2,X3),X4),rtrancl(contract)) ),
inference(fof_simplification,[status(thm)],[reduction_rls_3]) ).
cnf(c_0_12,plain,
( member(pair(X1,X1),rtrancl(contract))
| ~ member(X1,comb) ),
inference(fof_simplification,[status(thm)],[reduction_refl]) ).
cnf(c_0_13,plain,
( member(X2,comb)
| ~ member(comb_app(X1,X2),comb) ),
inference(fof_simplification,[status(thm)],[ap_E2]) ).
cnf(c_0_14,plain,
( member(pair(X2,X4),X1)
| ~ trans(X1)
| ~ member(pair(X2,X3),X1)
| ~ member(pair(X3,X4),X1) ),
inference(fof_simplification,[status(thm)],[transD]) ).
cnf(c_0_15,plain,
( member(pair(comb_app(X1,X3),X4),rtrancl(contract))
| ~ member(pair(X1,X2),contract)
| ~ member(X3,comb)
| ~ member(pair(comb_app(X2,X3),X4),rtrancl(contract)) ),
c_0_11 ).
cnf(c_0_16,plain,
( member(pair(X1,X1),rtrancl(contract))
| ~ member(X1,comb) ),
c_0_12 ).
cnf(c_0_17,plain,
( member(X2,comb)
| ~ member(comb_app(X1,X2),comb) ),
c_0_13 ).
cnf(c_0_18,plain,
( member(pair(X2,X4),X1)
| ~ trans(X1)
| ~ member(pair(X2,X3),X1)
| ~ member(pair(X3,X4),X1) ),
c_0_14 ).
cnf(c_0_19,plain,
( member(pair(comb_app(X1,X2),comb_app(X3,X2)),rtrancl(contract))
| ~ member(pair(X1,X3),contract)
| ~ member(comb_app(X3,X2),comb) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,axiom,
trans(rtrancl(X1)),
trans_rtrancl ).
cnf(c_0_21,negated_conjecture,
~ member(pair(comb_app(p,r),comb_app(z,r)),rtrancl(contract)),
inference(fof_simplification,[status(thm)],[ap_reduce1_2c1]) ).
cnf(c_0_22,plain,
( member(pair(X1,comb_app(X2,X3)),rtrancl(contract))
| ~ member(pair(X1,comb_app(X4,X3)),rtrancl(contract))
| ~ member(pair(X4,X2),contract)
| ~ member(comb_app(X2,X3),comb) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,hypothesis,
member(pair(comb_app(p,r),comb_app(y,r)),rtrancl(contract)),
ap_reduce1_2h5 ).
cnf(c_0_24,plain,
( member(X2,comb)
| ~ member(pair(X1,X2),contract) ),
inference(fof_simplification,[status(thm)],[contract_combD2]) ).
cnf(c_0_25,negated_conjecture,
~ member(pair(comb_app(p,r),comb_app(z,r)),rtrancl(contract)),
c_0_21 ).
cnf(c_0_26,hypothesis,
( member(pair(comb_app(p,r),comb_app(X1,r)),rtrancl(contract))
| ~ member(pair(y,X1),contract)
| ~ member(comb_app(X1,r),comb) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,hypothesis,
member(pair(y,z),contract),
ap_reduce1_2h4 ).
cnf(c_0_28,plain,
( member(comb_app(X1,X2),comb)
| ~ member(X1,comb)
| ~ member(X2,comb) ),
inference(fof_simplification,[status(thm)],[comb_intros3]) ).
cnf(c_0_29,plain,
( member(X2,comb)
| ~ member(pair(X1,X2),contract) ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
~ member(comb_app(z,r),comb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_31,plain,
( member(comb_app(X1,X2),comb)
| ~ member(X1,comb)
| ~ member(X2,comb) ),
c_0_28 ).
cnf(c_0_32,hypothesis,
member(r,comb),
ap_reduce1_2h1 ).
cnf(c_0_33,hypothesis,
member(z,comb),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : COL088-2 : TPTP v8.1.2. Released v2.7.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n013.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 11:29:49 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.QdXNauElWR/E---3.1_32375.p
% 192.03/24.86 # Version: 3.1.0
% 192.03/24.86 # Preprocessing class: FSLSSMSMSSSNFFN.
% 192.03/24.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 192.03/24.86 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 192.03/24.86 # Starting new_bool_3 with 300s (1) cores
% 192.03/24.86 # Starting new_bool_1 with 300s (1) cores
% 192.03/24.86 # Starting sh5l with 300s (1) cores
% 192.03/24.86 # sh5l with pid 32498 completed with status 0
% 192.03/24.86 # Result found by sh5l
% 192.03/24.86 # Preprocessing class: FSLSSMSMSSSNFFN.
% 192.03/24.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 192.03/24.86 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 192.03/24.86 # Starting new_bool_3 with 300s (1) cores
% 192.03/24.86 # Starting new_bool_1 with 300s (1) cores
% 192.03/24.86 # Starting sh5l with 300s (1) cores
% 192.03/24.86 # SinE strategy is gf500_gu_R04_F100_L20000
% 192.03/24.86 # Search class: FGUSF-FFMM32-MFFFFFNN
% 192.03/24.86 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 192.03/24.86 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 192.03/24.86 # SAT001_MinMin_p005000_rr_RG with pid 32502 completed with status 0
% 192.03/24.86 # Result found by SAT001_MinMin_p005000_rr_RG
% 192.03/24.86 # Preprocessing class: FSLSSMSMSSSNFFN.
% 192.03/24.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 192.03/24.86 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 192.03/24.86 # Starting new_bool_3 with 300s (1) cores
% 192.03/24.86 # Starting new_bool_1 with 300s (1) cores
% 192.03/24.86 # Starting sh5l with 300s (1) cores
% 192.03/24.86 # SinE strategy is gf500_gu_R04_F100_L20000
% 192.03/24.86 # Search class: FGUSF-FFMM32-MFFFFFNN
% 192.03/24.86 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 192.03/24.86 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 192.03/24.86 # Preprocessing time : 0.003 s
% 192.03/24.86 # Presaturation interreduction done
% 192.03/24.86
% 192.03/24.86 # Proof found!
% 192.03/24.86 # SZS status Unsatisfiable
% 192.03/24.86 # SZS output start CNFRefutation
% See solution above
% 192.03/24.86 # Parsed axioms : 186
% 192.03/24.86 # Removed by relevancy pruning/SinE : 138
% 192.03/24.86 # Initial clauses : 48
% 192.03/24.86 # Removed in clause preprocessing : 1
% 192.03/24.86 # Initial clauses in saturation : 47
% 192.03/24.86 # Processed clauses : 26133
% 192.03/24.86 # ...of these trivial : 0
% 192.03/24.86 # ...subsumed : 16075
% 192.03/24.86 # ...remaining for further processing : 10058
% 192.03/24.86 # Other redundant clauses eliminated : 439
% 192.03/24.86 # Clauses deleted for lack of memory : 0
% 192.03/24.86 # Backward-subsumed : 1311
% 192.03/24.86 # Backward-rewritten : 0
% 192.03/24.86 # Generated clauses : 496287
% 192.03/24.86 # ...of the previous two non-redundant : 491429
% 192.03/24.86 # ...aggressively subsumed : 0
% 192.03/24.86 # Contextual simplify-reflections : 824
% 192.03/24.86 # Paramodulations : 495839
% 192.03/24.86 # Factorizations : 0
% 192.03/24.86 # NegExts : 0
% 192.03/24.86 # Equation resolutions : 448
% 192.03/24.86 # Disequality decompositions : 0
% 192.03/24.86 # Total rewrite steps : 11261
% 192.03/24.86 # ...of those cached : 11252
% 192.03/24.86 # Propositional unsat checks : 2
% 192.03/24.86 # Propositional check models : 0
% 192.03/24.86 # Propositional check unsatisfiable : 0
% 192.03/24.86 # Propositional clauses : 0
% 192.03/24.86 # Propositional clauses after purity: 0
% 192.03/24.86 # Propositional unsat core size : 0
% 192.03/24.86 # Propositional preprocessing time : 0.000
% 192.03/24.86 # Propositional encoding time : 1.156
% 192.03/24.86 # Propositional solver time : 0.198
% 192.03/24.86 # Success case prop preproc time : 0.000
% 192.03/24.86 # Success case prop encoding time : 0.000
% 192.03/24.86 # Success case prop solver time : 0.000
% 192.03/24.86 # Current number of processed clauses : 8700
% 192.03/24.86 # Positive orientable unit clauses : 9
% 192.03/24.86 # Positive unorientable unit clauses: 0
% 192.03/24.86 # Negative unit clauses : 72
% 192.03/24.86 # Non-unit-clauses : 8619
% 192.03/24.86 # Current number of unprocessed clauses: 463230
% 192.03/24.86 # ...number of literals in the above : 2855215
% 192.03/24.86 # Current number of archived formulas : 0
% 192.03/24.86 # Current number of archived clauses : 1358
% 192.03/24.86 # Clause-clause subsumption calls (NU) : 59028947
% 192.03/24.86 # Rec. Clause-clause subsumption calls : 3220946
% 192.03/24.86 # Non-unit clause-clause subsumptions : 15112
% 192.03/24.86 # Unit Clause-clause subsumption calls : 32752
% 192.03/24.86 # Rewrite failures with RHS unbound : 0
% 192.03/24.86 # BW rewrite match attempts : 2
% 192.03/24.86 # BW rewrite match successes : 0
% 192.03/24.86 # Condensation attempts : 0
% 192.03/24.86 # Condensation successes : 0
% 192.03/24.86 # Termbank termtop insertions : 17852163
% 192.03/24.86 # Search garbage collected termcells : 684
% 192.03/24.86
% 192.03/24.86 # -------------------------------------------------
% 192.03/24.86 # User time : 23.522 s
% 192.03/24.86 # System time : 0.414 s
% 192.03/24.86 # Total time : 23.936 s
% 192.03/24.86 # Maximum resident set size: 2020 pages
% 192.03/24.86
% 192.03/24.86 # -------------------------------------------------
% 192.03/24.86 # User time : 23.525 s
% 192.03/24.86 # System time : 0.418 s
% 192.03/24.86 # Total time : 23.943 s
% 192.03/24.86 # Maximum resident set size: 1848 pages
% 192.03/24.86 % E---3.1 exiting
% 192.03/24.86 % E exiting
%------------------------------------------------------------------------------