TSTP Solution File: COL100-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL100-1 : 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:29:05 EDT 2024
% Result : Unsatisfiable 1.17s 0.61s
% Output : CNFRefutation 1.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 9 unt; 0 nHn; 33 RR)
% Number of literals : 84 ( 0 equ; 54 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 68 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
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.TCVc2CiQsC/E---3.1_31353.p',transD) ).
cnf(r_into_trancl,axiom,
( member(pair(X1,X2),trancl(X3))
| ~ member(pair(X1,X2),X3) ),
file('/export/starexec/sandbox/tmp/tmp.TCVc2CiQsC/E---3.1_31353.p',r_into_trancl) ).
cnf(trans_trancl,axiom,
trans(trancl(X1)),
file('/export/starexec/sandbox/tmp/tmp.TCVc2CiQsC/E---3.1_31353.p',trans_trancl) ).
cnf(diamond_trancl_2h5,hypothesis,
( member(pair(X1,sk1(X1)),trancl(r))
| ~ member(pair(y,X1),trancl(r)) ),
file('/export/starexec/sandbox/tmp/tmp.TCVc2CiQsC/E---3.1_31353.p',diamond_trancl_2h5) ).
cnf(diamond_strip_lemmaD2,axiom,
( member(pair(X3,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),X1)
| ~ diamond(X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ member(pair(X2,X4),X1) ),
file('/export/starexec/sandbox/tmp/tmp.TCVc2CiQsC/E---3.1_31353.p',diamond_strip_lemmaD2) ).
cnf(diamond_trancl_2c2,negated_conjecture,
( ~ member(pair(z,X1),trancl(r))
| ~ member(pair(yp,X1),trancl(r)) ),
file('/export/starexec/sandbox/tmp/tmp.TCVc2CiQsC/E---3.1_31353.p',diamond_trancl_2c2) ).
cnf(diamond_trancl_2h1,hypothesis,
diamond(r),
file('/export/starexec/sandbox/tmp/tmp.TCVc2CiQsC/E---3.1_31353.p',diamond_trancl_2h1) ).
cnf(diamond_trancl_2c1,negated_conjecture,
member(pair(y,yp),trancl(r)),
file('/export/starexec/sandbox/tmp/tmp.TCVc2CiQsC/E---3.1_31353.p',diamond_trancl_2c1) ).
cnf(diamond_strip_lemmaD1,axiom,
( member(pair(X4,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),trancl(X1))
| ~ diamond(X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ member(pair(X2,X4),X1) ),
file('/export/starexec/sandbox/tmp/tmp.TCVc2CiQsC/E---3.1_31353.p',diamond_strip_lemmaD1) ).
cnf(diamond_trancl_2h4,hypothesis,
( member(pair(ya,sk1(X1)),trancl(r))
| ~ member(pair(y,X1),trancl(r)) ),
file('/export/starexec/sandbox/tmp/tmp.TCVc2CiQsC/E---3.1_31353.p',diamond_trancl_2h4) ).
cnf(diamond_trancl_2h3,hypothesis,
member(pair(ya,z),r),
file('/export/starexec/sandbox/tmp/tmp.TCVc2CiQsC/E---3.1_31353.p',diamond_trancl_2h3) ).
cnf(c_0_11,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_12,plain,
( member(pair(X1,X2),trancl(X3))
| ~ member(pair(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[r_into_trancl]) ).
cnf(c_0_13,plain,
( member(pair(X2,X4),X1)
| ~ trans(X1)
| ~ member(pair(X2,X3),X1)
| ~ member(pair(X3,X4),X1) ),
c_0_11 ).
cnf(c_0_14,plain,
( member(pair(X1,X2),trancl(X3))
| ~ member(pair(X1,X2),X3) ),
c_0_12 ).
cnf(c_0_15,axiom,
trans(trancl(X1)),
trans_trancl ).
cnf(c_0_16,hypothesis,
( member(pair(X1,sk1(X1)),trancl(r))
| ~ member(pair(y,X1),trancl(r)) ),
inference(fof_simplification,[status(thm)],[diamond_trancl_2h5]) ).
cnf(c_0_17,plain,
( member(pair(X1,X2),trancl(X3))
| ~ member(pair(X1,X4),trancl(X3))
| ~ member(pair(X4,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_18,hypothesis,
( member(pair(X1,sk1(X1)),trancl(r))
| ~ member(pair(y,X1),trancl(r)) ),
c_0_16 ).
cnf(c_0_19,plain,
( member(pair(X3,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),X1)
| ~ diamond(X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ member(pair(X2,X4),X1) ),
inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD2]) ).
cnf(c_0_20,negated_conjecture,
( ~ member(pair(z,X1),trancl(r))
| ~ member(pair(yp,X1),trancl(r)) ),
inference(fof_simplification,[status(thm)],[diamond_trancl_2c2]) ).
cnf(c_0_21,hypothesis,
( member(pair(X1,X2),trancl(r))
| ~ member(pair(y,X1),trancl(r))
| ~ member(pair(sk1(X1),X2),r) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( member(pair(X3,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),X1)
| ~ diamond(X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ member(pair(X2,X4),X1) ),
c_0_19 ).
cnf(c_0_23,hypothesis,
diamond(r),
diamond_trancl_2h1 ).
cnf(c_0_24,negated_conjecture,
( ~ member(pair(z,X1),trancl(r))
| ~ member(pair(yp,X1),trancl(r)) ),
c_0_20 ).
cnf(c_0_25,hypothesis,
( member(pair(X1,diamond_strip_lemmaD_sk1(X2,sk1(X1),X3,r)),trancl(r))
| ~ member(pair(X2,sk1(X1)),trancl(r))
| ~ member(pair(y,X1),trancl(r))
| ~ member(pair(X2,X3),r) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
member(pair(y,yp),trancl(r)),
diamond_trancl_2c1 ).
cnf(c_0_27,plain,
( member(pair(X4,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),trancl(X1))
| ~ diamond(X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ member(pair(X2,X4),X1) ),
inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD1]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(pair(z,diamond_strip_lemmaD_sk1(X1,sk1(yp),X2,r)),trancl(r))
| ~ member(pair(X1,sk1(yp)),trancl(r))
| ~ member(pair(X1,X2),r) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_29,plain,
( member(pair(X4,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),trancl(X1))
| ~ diamond(X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ member(pair(X2,X4),X1) ),
c_0_27 ).
cnf(c_0_30,hypothesis,
( member(pair(ya,sk1(X1)),trancl(r))
| ~ member(pair(y,X1),trancl(r)) ),
inference(fof_simplification,[status(thm)],[diamond_trancl_2h4]) ).
cnf(c_0_31,negated_conjecture,
( ~ member(pair(X1,sk1(yp)),trancl(r))
| ~ member(pair(X1,z),r) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_23])]) ).
cnf(c_0_32,hypothesis,
( member(pair(ya,sk1(X1)),trancl(r))
| ~ member(pair(y,X1),trancl(r)) ),
c_0_30 ).
cnf(c_0_33,hypothesis,
member(pair(ya,z),r),
diamond_trancl_2h3 ).
cnf(c_0_34,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL100-1 : TPTP v8.1.2. Released v2.7.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 11:29:34 EDT 2024
% 0.14/0.34 % 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.TCVc2CiQsC/E---3.1_31353.p
% 1.17/0.61 # Version: 3.1.0
% 1.17/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.17/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.17/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.17/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.17/0.61 # Starting sh5l with 300s (1) cores
% 1.17/0.61 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31431 completed with status 0
% 1.17/0.61 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.17/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.17/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.17/0.61 # No SInE strategy applied
% 1.17/0.61 # Search class: FHHSF-FFSS32-SFFFFFNN
% 1.17/0.61 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.17/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.17/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.17/0.61 # Starting new_bool_3 with 136s (1) cores
% 1.17/0.61 # Starting new_bool_1 with 136s (1) cores
% 1.17/0.61 # Starting sh5l with 136s (1) cores
% 1.17/0.61 # SAT001_MinMin_p005000_rr_RG with pid 31436 completed with status 0
% 1.17/0.61 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.17/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.17/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.17/0.61 # No SInE strategy applied
% 1.17/0.61 # Search class: FHHSF-FFSS32-SFFFFFNN
% 1.17/0.61 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.17/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.17/0.61 # Preprocessing time : 0.001 s
% 1.17/0.61 # Presaturation interreduction done
% 1.17/0.61
% 1.17/0.61 # Proof found!
% 1.17/0.61 # SZS status Unsatisfiable
% 1.17/0.61 # SZS output start CNFRefutation
% See solution above
% 1.17/0.61 # Parsed axioms : 18
% 1.17/0.61 # Removed by relevancy pruning/SinE : 0
% 1.17/0.61 # Initial clauses : 18
% 1.17/0.61 # Removed in clause preprocessing : 1
% 1.17/0.61 # Initial clauses in saturation : 17
% 1.17/0.61 # Processed clauses : 1407
% 1.17/0.61 # ...of these trivial : 0
% 1.17/0.61 # ...subsumed : 919
% 1.17/0.61 # ...remaining for further processing : 488
% 1.17/0.61 # Other redundant clauses eliminated : 0
% 1.17/0.61 # Clauses deleted for lack of memory : 0
% 1.17/0.61 # Backward-subsumed : 45
% 1.17/0.61 # Backward-rewritten : 0
% 1.17/0.61 # Generated clauses : 3002
% 1.17/0.61 # ...of the previous two non-redundant : 2964
% 1.17/0.61 # ...aggressively subsumed : 0
% 1.17/0.61 # Contextual simplify-reflections : 4
% 1.17/0.61 # Paramodulations : 3000
% 1.17/0.61 # Factorizations : 0
% 1.17/0.61 # NegExts : 0
% 1.17/0.61 # Equation resolutions : 2
% 1.17/0.61 # Disequality decompositions : 0
% 1.17/0.61 # Total rewrite steps : 677
% 1.17/0.61 # ...of those cached : 663
% 1.17/0.61 # Propositional unsat checks : 0
% 1.17/0.61 # Propositional check models : 0
% 1.17/0.61 # Propositional check unsatisfiable : 0
% 1.17/0.61 # Propositional clauses : 0
% 1.17/0.61 # Propositional clauses after purity: 0
% 1.17/0.61 # Propositional unsat core size : 0
% 1.17/0.61 # Propositional preprocessing time : 0.000
% 1.17/0.61 # Propositional encoding time : 0.000
% 1.17/0.61 # Propositional solver time : 0.000
% 1.17/0.61 # Success case prop preproc time : 0.000
% 1.17/0.61 # Success case prop encoding time : 0.000
% 1.17/0.61 # Success case prop solver time : 0.000
% 1.17/0.61 # Current number of processed clauses : 426
% 1.17/0.61 # Positive orientable unit clauses : 5
% 1.17/0.61 # Positive unorientable unit clauses: 0
% 1.17/0.61 # Negative unit clauses : 18
% 1.17/0.61 # Non-unit-clauses : 403
% 1.17/0.61 # Current number of unprocessed clauses: 1524
% 1.17/0.61 # ...number of literals in the above : 8999
% 1.17/0.61 # Current number of archived formulas : 0
% 1.17/0.61 # Current number of archived clauses : 62
% 1.17/0.61 # Clause-clause subsumption calls (NU) : 107709
% 1.17/0.61 # Rec. Clause-clause subsumption calls : 21613
% 1.17/0.61 # Non-unit clause-clause subsumptions : 293
% 1.17/0.61 # Unit Clause-clause subsumption calls : 784
% 1.17/0.61 # Rewrite failures with RHS unbound : 0
% 1.17/0.61 # BW rewrite match attempts : 0
% 1.17/0.61 # BW rewrite match successes : 0
% 1.17/0.61 # Condensation attempts : 0
% 1.17/0.61 # Condensation successes : 0
% 1.17/0.61 # Termbank termtop insertions : 85496
% 1.17/0.61 # Search garbage collected termcells : 48
% 1.17/0.61
% 1.17/0.61 # -------------------------------------------------
% 1.17/0.61 # User time : 0.125 s
% 1.17/0.61 # System time : 0.006 s
% 1.17/0.61 # Total time : 0.130 s
% 1.17/0.61 # Maximum resident set size: 1632 pages
% 1.17/0.61
% 1.17/0.61 # -------------------------------------------------
% 1.17/0.61 # User time : 0.634 s
% 1.17/0.61 # System time : 0.013 s
% 1.17/0.61 # Total time : 0.647 s
% 1.17/0.61 # Maximum resident set size: 1704 pages
% 1.17/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------