TSTP Solution File: SWC191-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC191-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:41:58 EDT 2023
% Result : Unsatisfiable 0.17s 0.50s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of clauses : 45 ( 28 unt; 0 nHn; 45 RR)
% Number of literals : 92 ( 29 equ; 49 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_14,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',co1_14) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',co1_6) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',clause149) ).
cnf(co1_12,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',co1_12) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',clause86) ).
cnf(co1_10,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',co1_10) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',clause8) ).
cnf(co1_11,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',co1_11) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',clause120) ).
cnf(co1_13,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',co1_13) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',clause157) ).
cnf(clause180,axiom,
( X2 = X3
| app(X1,cons(X2,cons(X3,X4))) != X5
| ~ ssList(X4)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ equalelemsP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',clause180) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',co1_1) ).
cnf(co1_8,negated_conjecture,
equalelemsP(sk3),
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',co1_8) ).
cnf(co1_15,negated_conjecture,
sk5 != sk6,
file('/export/starexec/sandbox/tmp/tmp.xWuNmvqYzO/E---3.1_6020.p',co1_15) ).
cnf(c_0_15,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_14 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk3,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_19,negated_conjecture,
ssList(sk7),
co1_12 ).
cnf(c_0_20,negated_conjecture,
( app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk3
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_21,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_22,negated_conjecture,
ssItem(sk5),
co1_10 ).
cnf(c_0_23,axiom,
ssList(nil),
clause8 ).
cnf(c_0_24,negated_conjecture,
( app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_25,negated_conjecture,
ssItem(sk6),
co1_11 ).
cnf(c_0_26,negated_conjecture,
app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_21]),c_0_25]),c_0_23])]) ).
cnf(c_0_27,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_28,negated_conjecture,
( app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_21]),c_0_25]),c_0_23])]) ).
cnf(c_0_30,negated_conjecture,
ssList(sk8),
co1_13 ).
cnf(c_0_31,negated_conjecture,
( app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk3
| ~ ssList(cons(sk5,cons(sk6,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_29]),c_0_19]),c_0_30])]) ).
cnf(c_0_32,negated_conjecture,
( app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_21]),c_0_22])]) ).
cnf(c_0_33,negated_conjecture,
app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_21]),c_0_25]),c_0_23])]) ).
cnf(c_0_34,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_35,negated_conjecture,
( app(sk7,cons(sk5,app(cons(sk6,nil),sk8))) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_22]),c_0_30])]) ).
cnf(c_0_36,axiom,
( X2 = X3
| app(X1,cons(X2,cons(X3,X4))) != X5
| ~ ssList(X4)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ equalelemsP(X5)
| ~ ssList(X5) ),
clause180 ).
cnf(c_0_37,negated_conjecture,
app(sk7,cons(sk5,app(cons(sk6,nil),sk8))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_21]),c_0_25]),c_0_23])]) ).
cnf(c_0_38,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_39,plain,
( X1 = X2
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ equalelemsP(app(X3,cons(X1,cons(X2,X4)))) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_40,negated_conjecture,
app(sk7,cons(sk5,cons(sk6,sk8))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_27]),c_0_25]),c_0_30])]) ).
cnf(c_0_41,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_38,c_0_16]) ).
cnf(c_0_42,negated_conjecture,
equalelemsP(sk3),
co1_8 ).
cnf(c_0_43,negated_conjecture,
sk5 != sk6,
co1_15 ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_25]),c_0_22]),c_0_41]),c_0_30]),c_0_19]),c_0_42])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC191-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 01:58:01 EDT 2023
% 0.17/0.32 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 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.xWuNmvqYzO/E---3.1_6020.p
% 0.17/0.50 # Version: 3.1pre001
% 0.17/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 # Starting sh5l with 300s (1) cores
% 0.17/0.50 # sh5l with pid 6105 completed with status 0
% 0.17/0.50 # Result found by sh5l
% 0.17/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 # Starting sh5l with 300s (1) cores
% 0.17/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.50 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.17/0.50 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.17/0.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 6113 completed with status 0
% 0.17/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.17/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 # Starting sh5l with 300s (1) cores
% 0.17/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.50 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.17/0.50 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.17/0.50 # Preprocessing time : 0.003 s
% 0.17/0.50 # Presaturation interreduction done
% 0.17/0.50
% 0.17/0.50 # Proof found!
% 0.17/0.50 # SZS status Unsatisfiable
% 0.17/0.50 # SZS output start CNFRefutation
% See solution above
% 0.17/0.50 # Parsed axioms : 200
% 0.17/0.50 # Removed by relevancy pruning/SinE : 21
% 0.17/0.50 # Initial clauses : 179
% 0.17/0.50 # Removed in clause preprocessing : 0
% 0.17/0.50 # Initial clauses in saturation : 179
% 0.17/0.50 # Processed clauses : 467
% 0.17/0.50 # ...of these trivial : 2
% 0.17/0.50 # ...subsumed : 42
% 0.17/0.50 # ...remaining for further processing : 423
% 0.17/0.50 # Other redundant clauses eliminated : 34
% 0.17/0.50 # Clauses deleted for lack of memory : 0
% 0.17/0.50 # Backward-subsumed : 5
% 0.17/0.50 # Backward-rewritten : 19
% 0.17/0.50 # Generated clauses : 502
% 0.17/0.50 # ...of the previous two non-redundant : 433
% 0.17/0.50 # ...aggressively subsumed : 0
% 0.17/0.50 # Contextual simplify-reflections : 10
% 0.17/0.50 # Paramodulations : 464
% 0.17/0.50 # Factorizations : 0
% 0.17/0.50 # NegExts : 0
% 0.17/0.50 # Equation resolutions : 39
% 0.17/0.50 # Total rewrite steps : 481
% 0.17/0.50 # Propositional unsat checks : 0
% 0.17/0.50 # Propositional check models : 0
% 0.17/0.50 # Propositional check unsatisfiable : 0
% 0.17/0.50 # Propositional clauses : 0
% 0.17/0.50 # Propositional clauses after purity: 0
% 0.17/0.50 # Propositional unsat core size : 0
% 0.17/0.50 # Propositional preprocessing time : 0.000
% 0.17/0.50 # Propositional encoding time : 0.000
% 0.17/0.50 # Propositional solver time : 0.000
% 0.17/0.50 # Success case prop preproc time : 0.000
% 0.17/0.50 # Success case prop encoding time : 0.000
% 0.17/0.50 # Success case prop solver time : 0.000
% 0.17/0.50 # Current number of processed clauses : 207
% 0.17/0.50 # Positive orientable unit clauses : 69
% 0.17/0.50 # Positive unorientable unit clauses: 0
% 0.17/0.50 # Negative unit clauses : 1
% 0.17/0.50 # Non-unit-clauses : 137
% 0.17/0.50 # Current number of unprocessed clauses: 299
% 0.17/0.50 # ...number of literals in the above : 1394
% 0.17/0.50 # Current number of archived formulas : 0
% 0.17/0.50 # Current number of archived clauses : 195
% 0.17/0.50 # Clause-clause subsumption calls (NU) : 11527
% 0.17/0.50 # Rec. Clause-clause subsumption calls : 2202
% 0.17/0.50 # Non-unit clause-clause subsumptions : 57
% 0.17/0.50 # Unit Clause-clause subsumption calls : 84
% 0.17/0.50 # Rewrite failures with RHS unbound : 0
% 0.17/0.50 # BW rewrite match attempts : 12
% 0.17/0.50 # BW rewrite match successes : 10
% 0.17/0.50 # Condensation attempts : 0
% 0.17/0.50 # Condensation successes : 0
% 0.17/0.50 # Termbank termtop insertions : 15450
% 0.17/0.50
% 0.17/0.50 # -------------------------------------------------
% 0.17/0.50 # User time : 0.034 s
% 0.17/0.50 # System time : 0.004 s
% 0.17/0.50 # Total time : 0.038 s
% 0.17/0.50 # Maximum resident set size: 2212 pages
% 0.17/0.50
% 0.17/0.50 # -------------------------------------------------
% 0.17/0.50 # User time : 0.036 s
% 0.17/0.50 # System time : 0.006 s
% 0.17/0.50 # Total time : 0.042 s
% 0.17/0.50 # Maximum resident set size: 1852 pages
% 0.17/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------