TSTP Solution File: SWC175-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC175-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:53 EDT 2023
% Result : Unsatisfiable 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of clauses : 45 ( 27 unt; 2 nHn; 45 RR)
% Number of literals : 98 ( 19 equ; 55 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_15,negated_conjecture,
app(app(app(sk8,cons(sk6,nil)),cons(sk7,nil)),sk9) = sk1,
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',co1_15) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',co1_6) ).
cnf(co1_16,negated_conjecture,
~ neq(sk6,sk7),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',co1_16) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',clause102) ).
cnf(co1_11,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',co1_11) ).
cnf(co1_12,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',co1_12) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',clause149) ).
cnf(co1_14,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',co1_14) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',clause8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',clause85) ).
cnf(co1_13,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',co1_13) ).
cnf(clause181,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',clause181) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',clause120) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',co1_1) ).
cnf(co1_9,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',co1_9) ).
cnf(clause63,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.JduU7eH0N0/E---3.1_30387.p',clause63) ).
cnf(c_0_17,negated_conjecture,
app(app(app(sk8,cons(sk6,nil)),cons(sk7,nil)),sk9) = sk1,
co1_15 ).
cnf(c_0_18,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_19,negated_conjecture,
~ neq(sk6,sk7),
co1_16 ).
cnf(c_0_20,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
clause102 ).
cnf(c_0_21,negated_conjecture,
ssItem(sk6),
co1_11 ).
cnf(c_0_22,negated_conjecture,
ssItem(sk7),
co1_12 ).
cnf(c_0_23,negated_conjecture,
app(app(app(sk8,cons(sk6,nil)),cons(sk7,nil)),sk9) = sk3,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_25,negated_conjecture,
sk7 = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_26,negated_conjecture,
ssList(sk9),
co1_14 ).
cnf(c_0_27,negated_conjecture,
( app(app(sk8,cons(sk6,nil)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(app(sk8,cons(sk6,nil)))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_25]),c_0_26])]) ).
cnf(c_0_28,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_29,axiom,
ssList(nil),
clause8 ).
cnf(c_0_30,negated_conjecture,
( app(app(sk8,cons(sk6,nil)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(app(sk8,cons(sk6,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21]),c_0_29])]) ).
cnf(c_0_31,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_32,negated_conjecture,
ssList(sk8),
co1_13 ).
cnf(c_0_33,negated_conjecture,
( app(app(sk8,cons(sk6,nil)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_34,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
clause181 ).
cnf(c_0_35,negated_conjecture,
app(app(sk8,cons(sk6,nil)),app(cons(sk6,nil),sk9)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_28]),c_0_21]),c_0_29])]) ).
cnf(c_0_36,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_37,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_38,plain,
( lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
app(app(sk8,cons(sk6,nil)),cons(sk6,sk9)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_21]),c_0_26])]) ).
cnf(c_0_40,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_37,c_0_18]) ).
cnf(c_0_41,negated_conjecture,
strictorderedP(sk3),
co1_9 ).
cnf(c_0_42,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
clause63 ).
cnf(c_0_43,negated_conjecture,
lt(sk6,sk6),
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_38,c_0_39]),c_0_21]),c_0_40]),c_0_26]),c_0_29]),c_0_32]),c_0_41])]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWC175-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n031.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue Oct 3 02:29:43 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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/tmp/tmp.JduU7eH0N0/E---3.1_30387.p
% 0.15/0.46 # Version: 3.1pre001
% 0.15/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 # Starting sh5l with 300s (1) cores
% 0.15/0.46 # sh5l with pid 30467 completed with status 0
% 0.15/0.46 # Result found by sh5l
% 0.15/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 # Starting sh5l with 300s (1) cores
% 0.15/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.46 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.15/0.46 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.15/0.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 30475 completed with status 0
% 0.15/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.15/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 # Starting sh5l with 300s (1) cores
% 0.15/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.46 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.15/0.46 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.15/0.46 # Preprocessing time : 0.002 s
% 0.15/0.46 # Presaturation interreduction done
% 0.15/0.46
% 0.15/0.46 # Proof found!
% 0.15/0.46 # SZS status Unsatisfiable
% 0.15/0.46 # SZS output start CNFRefutation
% See solution above
% 0.15/0.46 # Parsed axioms : 202
% 0.15/0.46 # Removed by relevancy pruning/SinE : 30
% 0.15/0.46 # Initial clauses : 172
% 0.15/0.46 # Removed in clause preprocessing : 0
% 0.15/0.46 # Initial clauses in saturation : 172
% 0.15/0.46 # Processed clauses : 590
% 0.15/0.46 # ...of these trivial : 6
% 0.15/0.46 # ...subsumed : 62
% 0.15/0.46 # ...remaining for further processing : 522
% 0.15/0.46 # Other redundant clauses eliminated : 32
% 0.15/0.46 # Clauses deleted for lack of memory : 0
% 0.15/0.46 # Backward-subsumed : 14
% 0.15/0.46 # Backward-rewritten : 32
% 0.15/0.46 # Generated clauses : 881
% 0.15/0.46 # ...of the previous two non-redundant : 763
% 0.15/0.46 # ...aggressively subsumed : 0
% 0.15/0.46 # Contextual simplify-reflections : 21
% 0.15/0.46 # Paramodulations : 845
% 0.15/0.46 # Factorizations : 0
% 0.15/0.46 # NegExts : 0
% 0.15/0.46 # Equation resolutions : 37
% 0.15/0.46 # Total rewrite steps : 917
% 0.15/0.46 # Propositional unsat checks : 0
% 0.15/0.46 # Propositional check models : 0
% 0.15/0.46 # Propositional check unsatisfiable : 0
% 0.15/0.46 # Propositional clauses : 0
% 0.15/0.46 # Propositional clauses after purity: 0
% 0.15/0.46 # Propositional unsat core size : 0
% 0.15/0.46 # Propositional preprocessing time : 0.000
% 0.15/0.46 # Propositional encoding time : 0.000
% 0.15/0.46 # Propositional solver time : 0.000
% 0.15/0.46 # Success case prop preproc time : 0.000
% 0.15/0.46 # Success case prop encoding time : 0.000
% 0.15/0.46 # Success case prop solver time : 0.000
% 0.15/0.46 # Current number of processed clauses : 292
% 0.15/0.46 # Positive orientable unit clauses : 82
% 0.15/0.46 # Positive unorientable unit clauses: 0
% 0.15/0.46 # Negative unit clauses : 1
% 0.15/0.46 # Non-unit-clauses : 209
% 0.15/0.46 # Current number of unprocessed clauses: 503
% 0.15/0.46 # ...number of literals in the above : 2329
% 0.15/0.46 # Current number of archived formulas : 0
% 0.15/0.46 # Current number of archived clauses : 210
% 0.15/0.46 # Clause-clause subsumption calls (NU) : 15150
% 0.15/0.46 # Rec. Clause-clause subsumption calls : 5162
% 0.15/0.46 # Non-unit clause-clause subsumptions : 97
% 0.15/0.46 # Unit Clause-clause subsumption calls : 450
% 0.15/0.46 # Rewrite failures with RHS unbound : 0
% 0.15/0.46 # BW rewrite match attempts : 21
% 0.15/0.46 # BW rewrite match successes : 18
% 0.15/0.46 # Condensation attempts : 0
% 0.15/0.46 # Condensation successes : 0
% 0.15/0.46 # Termbank termtop insertions : 22716
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.042 s
% 0.15/0.46 # System time : 0.002 s
% 0.15/0.46 # Total time : 0.044 s
% 0.15/0.46 # Maximum resident set size: 2204 pages
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.047 s
% 0.15/0.46 # System time : 0.003 s
% 0.15/0.46 # Total time : 0.050 s
% 0.15/0.46 # Maximum resident set size: 1856 pages
% 0.15/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------