TSTP Solution File: COL098-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL098-1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:20 EDT 2024
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 37 ( 13 unt; 0 nHn; 35 RR)
% Number of literals : 73 ( 0 equ; 40 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 53 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(diamond_strip_lemmaD_2h1,hypothesis,
( member(pair(X2,sk1(X1,X2,X3)),r)
| ~ member(pair(X1,X2),r)
| ~ member(pair(X1,X3),r) ),
file('/export/starexec/sandbox/tmp/tmp.vz7x5NZK3x/E---3.1_21099.p',diamond_strip_lemmaD_2h1) ).
cnf(diamond_strip_lemmaD_2h6,hypothesis,
( member(pair(y,sk2(X1)),r)
| ~ member(pair(x,X1),r) ),
file('/export/starexec/sandbox/tmp/tmp.vz7x5NZK3x/E---3.1_21099.p',diamond_strip_lemmaD_2h6) ).
cnf(diamond_strip_lemmaD_2h4,hypothesis,
member(pair(y,z),r),
file('/export/starexec/sandbox/tmp/tmp.vz7x5NZK3x/E---3.1_21099.p',diamond_strip_lemmaD_2h4) ).
cnf(diamond_strip_lemmaD_2c1,negated_conjecture,
member(pair(x,sk3),r),
file('/export/starexec/sandbox/tmp/tmp.vz7x5NZK3x/E---3.1_21099.p',diamond_strip_lemmaD_2c1) ).
cnf(diamond_strip_lemmaD_2h2,hypothesis,
( member(pair(X3,sk1(X1,X2,X3)),r)
| ~ member(pair(X1,X2),r)
| ~ member(pair(X1,X3),r) ),
file('/export/starexec/sandbox/tmp/tmp.vz7x5NZK3x/E---3.1_21099.p',diamond_strip_lemmaD_2h2) ).
cnf(r_into_trancl,axiom,
( member(pair(X1,X2),trancl(X3))
| ~ member(pair(X1,X2),X3) ),
file('/export/starexec/sandbox/tmp/tmp.vz7x5NZK3x/E---3.1_21099.p',r_into_trancl) ).
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.vz7x5NZK3x/E---3.1_21099.p',transD) ).
cnf(diamond_strip_lemmaD_2h5,hypothesis,
( member(pair(X1,sk2(X1)),trancl(r))
| ~ member(pair(x,X1),r) ),
file('/export/starexec/sandbox/tmp/tmp.vz7x5NZK3x/E---3.1_21099.p',diamond_strip_lemmaD_2h5) ).
cnf(diamond_strip_lemmaD_2c2,negated_conjecture,
( ~ member(pair(sk3,X1),trancl(r))
| ~ member(pair(z,X1),r) ),
file('/export/starexec/sandbox/tmp/tmp.vz7x5NZK3x/E---3.1_21099.p',diamond_strip_lemmaD_2c2) ).
cnf(trans_trancl,axiom,
trans(trancl(X1)),
file('/export/starexec/sandbox/tmp/tmp.vz7x5NZK3x/E---3.1_21099.p',trans_trancl) ).
cnf(c_0_10,hypothesis,
( member(pair(X2,sk1(X1,X2,X3)),r)
| ~ member(pair(X1,X2),r)
| ~ member(pair(X1,X3),r) ),
inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD_2h1]) ).
cnf(c_0_11,hypothesis,
( member(pair(y,sk2(X1)),r)
| ~ member(pair(x,X1),r) ),
inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD_2h6]) ).
cnf(c_0_12,hypothesis,
( member(pair(X2,sk1(X1,X2,X3)),r)
| ~ member(pair(X1,X2),r)
| ~ member(pair(X1,X3),r) ),
c_0_10 ).
cnf(c_0_13,hypothesis,
member(pair(y,z),r),
diamond_strip_lemmaD_2h4 ).
cnf(c_0_14,hypothesis,
( member(pair(y,sk2(X1)),r)
| ~ member(pair(x,X1),r) ),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
member(pair(x,sk3),r),
diamond_strip_lemmaD_2c1 ).
cnf(c_0_16,hypothesis,
( member(pair(X3,sk1(X1,X2,X3)),r)
| ~ member(pair(X1,X2),r)
| ~ member(pair(X1,X3),r) ),
inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD_2h2]) ).
cnf(c_0_17,plain,
( member(pair(X1,X2),trancl(X3))
| ~ member(pair(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[r_into_trancl]) ).
cnf(c_0_18,hypothesis,
( member(pair(X1,sk1(y,X1,z)),r)
| ~ member(pair(y,X1),r) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
member(pair(y,sk2(sk3)),r),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,hypothesis,
( member(pair(X3,sk1(X1,X2,X3)),r)
| ~ member(pair(X1,X2),r)
| ~ member(pair(X1,X3),r) ),
c_0_16 ).
cnf(c_0_21,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_22,plain,
( member(pair(X1,X2),trancl(X3))
| ~ member(pair(X1,X2),X3) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
member(pair(sk2(sk3),sk1(y,sk2(sk3),z)),r),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,hypothesis,
( member(pair(X1,sk2(X1)),trancl(r))
| ~ member(pair(x,X1),r) ),
inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD_2h5]) ).
cnf(c_0_25,negated_conjecture,
( ~ member(pair(sk3,X1),trancl(r))
| ~ member(pair(z,X1),r) ),
inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD_2c2]) ).
cnf(c_0_26,hypothesis,
( member(pair(z,sk1(y,X1,z)),r)
| ~ member(pair(y,X1),r) ),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_27,plain,
( member(pair(X2,X4),X1)
| ~ trans(X1)
| ~ member(pair(X2,X3),X1)
| ~ member(pair(X3,X4),X1) ),
c_0_21 ).
cnf(c_0_28,negated_conjecture,
member(pair(sk2(sk3),sk1(y,sk2(sk3),z)),trancl(r)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,axiom,
trans(trancl(X1)),
trans_trancl ).
cnf(c_0_30,hypothesis,
( member(pair(X1,sk2(X1)),trancl(r))
| ~ member(pair(x,X1),r) ),
c_0_24 ).
cnf(c_0_31,negated_conjecture,
( ~ member(pair(sk3,X1),trancl(r))
| ~ member(pair(z,X1),r) ),
c_0_25 ).
cnf(c_0_32,negated_conjecture,
member(pair(z,sk1(y,sk2(sk3),z)),r),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_33,negated_conjecture,
( member(pair(X1,sk1(y,sk2(sk3),z)),trancl(r))
| ~ member(pair(X1,sk2(sk3)),trancl(r)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_34,negated_conjecture,
member(pair(sk3,sk2(sk3)),trancl(r)),
inference(spm,[status(thm)],[c_0_30,c_0_15]) ).
cnf(c_0_35,negated_conjecture,
~ member(pair(sk3,sk1(y,sk2(sk3),z)),trancl(r)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COL098-1 : TPTP v8.1.2. Released v2.7.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n024.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:35:20 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.vz7x5NZK3x/E---3.1_21099.p
% 0.21/0.53 # Version: 3.1.0
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21189 completed with status 0
% 0.21/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FHHSF-FFSS31-SFFFFFNN
% 0.21/0.53 # partial match(1): FHHSF-FFSS21-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 811s (1) cores
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.53 # Starting sh5l with 136s (1) cores
% 0.21/0.53 # G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with pid 21196 completed with status 0
% 0.21/0.53 # Result found by G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FHHSF-FFSS31-SFFFFFNN
% 0.21/0.53 # partial match(1): FHHSF-FFSS21-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 811s (1) cores
% 0.21/0.53 # Preprocessing time : 0.002 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 17
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 17
% 0.21/0.53 # Removed in clause preprocessing : 1
% 0.21/0.53 # Initial clauses in saturation : 16
% 0.21/0.53 # Processed clauses : 274
% 0.21/0.53 # ...of these trivial : 1
% 0.21/0.53 # ...subsumed : 0
% 0.21/0.53 # ...remaining for further processing : 273
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 0
% 0.21/0.53 # Backward-rewritten : 0
% 0.21/0.53 # Generated clauses : 413
% 0.21/0.53 # ...of the previous two non-redundant : 382
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 411
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 2
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 177
% 0.21/0.53 # ...of those cached : 140
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 257
% 0.21/0.53 # Positive orientable unit clauses : 161
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 6
% 0.21/0.53 # Non-unit-clauses : 90
% 0.21/0.53 # Current number of unprocessed clauses: 140
% 0.21/0.53 # ...number of literals in the above : 240
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 16
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 969
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 953
% 0.21/0.53 # Non-unit clause-clause subsumptions : 0
% 0.21/0.53 # Unit Clause-clause subsumption calls : 12
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 747
% 0.21/0.53 # BW rewrite match successes : 0
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 11168
% 0.21/0.53 # Search garbage collected termcells : 45
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.032 s
% 0.21/0.53 # System time : 0.003 s
% 0.21/0.53 # Total time : 0.035 s
% 0.21/0.53 # Maximum resident set size: 1676 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.149 s
% 0.21/0.53 # System time : 0.009 s
% 0.21/0.53 # Total time : 0.158 s
% 0.21/0.53 # Maximum resident set size: 1708 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.53 % E exiting
%------------------------------------------------------------------------------