TSTP Solution File: SWC220-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC220-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:42:05 EDT 2023
% Result : Unsatisfiable 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 37 ( 14 unt; 10 nHn; 37 RR)
% Number of literals : 102 ( 27 equ; 59 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_16,negated_conjecture,
( nil = sk3
| app(app(sk7,cons(sk6,nil)),sk8) = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.vqPTnCirfl/E---3.1_30366.p',co1_16) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.vqPTnCirfl/E---3.1_30366.p',co1_6) ).
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/tmp/tmp.vqPTnCirfl/E---3.1_30366.p',co1_7) ).
cnf(co1_13,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
file('/export/starexec/sandbox/tmp/tmp.vqPTnCirfl/E---3.1_30366.p',co1_13) ).
cnf(co1_15,negated_conjecture,
( nil = sk3
| ssList(sk8) ),
file('/export/starexec/sandbox/tmp/tmp.vqPTnCirfl/E---3.1_30366.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
file('/export/starexec/sandbox/tmp/tmp.vqPTnCirfl/E---3.1_30366.p',co1_14) ).
cnf(co1_17,negated_conjecture,
( nil = sk3
| leq(X1,sk6)
| ~ ssItem(X1)
| ~ memberP(sk7,X1)
| ~ memberP(sk8,X1)
| ~ leq(sk6,X1) ),
file('/export/starexec/sandbox/tmp/tmp.vqPTnCirfl/E---3.1_30366.p',co1_17) ).
cnf(co1_11,negated_conjecture,
( leq(X1,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/tmp/tmp.vqPTnCirfl/E---3.1_30366.p',co1_11) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/tmp/tmp.vqPTnCirfl/E---3.1_30366.p',co1_8) ).
cnf(co1_10,negated_conjecture,
( memberP(X3,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/tmp/tmp.vqPTnCirfl/E---3.1_30366.p',co1_10) ).
cnf(co1_9,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/tmp/tmp.vqPTnCirfl/E---3.1_30366.p',co1_9) ).
cnf(co1_12,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ leq(sk5(X3,X2,X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.vqPTnCirfl/E---3.1_30366.p',co1_12) ).
cnf(c_0_12,negated_conjecture,
( nil = sk3
| app(app(sk7,cons(sk6,nil)),sk8) = sk3 ),
co1_16 ).
cnf(c_0_13,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_14,negated_conjecture,
nil != sk1,
co1_7 ).
cnf(c_0_15,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
co1_13 ).
cnf(c_0_16,negated_conjecture,
( nil = sk3
| ssList(sk8) ),
co1_15 ).
cnf(c_0_17,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
co1_14 ).
cnf(c_0_18,negated_conjecture,
( nil = sk3
| leq(X1,sk6)
| ~ ssItem(X1)
| ~ memberP(sk7,X1)
| ~ memberP(sk8,X1)
| ~ leq(sk6,X1) ),
co1_17 ).
cnf(c_0_19,negated_conjecture,
( leq(X1,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
co1_11 ).
cnf(c_0_20,negated_conjecture,
app(app(sk7,cons(sk6,nil)),sk8) = sk1,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]),c_0_14]) ).
cnf(c_0_21,negated_conjecture,
ssItem(sk6),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_13]),c_0_14]) ).
cnf(c_0_22,negated_conjecture,
ssList(sk8),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_13]),c_0_14]) ).
cnf(c_0_23,negated_conjecture,
ssList(sk7),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_13]),c_0_14]) ).
cnf(c_0_24,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
co1_8 ).
cnf(c_0_25,negated_conjecture,
( leq(X1,sk6)
| ~ memberP(sk7,X1)
| ~ memberP(sk8,X1)
| ~ leq(sk6,X1)
| ~ ssItem(X1) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_13]),c_0_14]) ).
cnf(c_0_26,negated_conjecture,
leq(sk6,sk5(sk8,sk7,sk6)),
inference(cn,[status(thm)],[inference(rw,[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]),c_0_23])]) ).
cnf(c_0_27,negated_conjecture,
ssItem(sk5(sk8,sk7,sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_20]),c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
( memberP(X3,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
co1_10 ).
cnf(c_0_29,negated_conjecture,
( leq(sk5(sk8,sk7,sk6),sk6)
| ~ memberP(sk7,sk5(sk8,sk7,sk6))
| ~ memberP(sk8,sk5(sk8,sk7,sk6)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_30,negated_conjecture,
memberP(sk8,sk5(sk8,sk7,sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_31,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
co1_9 ).
cnf(c_0_32,negated_conjecture,
( leq(sk5(sk8,sk7,sk6),sk6)
| ~ memberP(sk7,sk5(sk8,sk7,sk6)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
memberP(sk7,sk5(sk8,sk7,sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_20]),c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ leq(sk5(X3,X2,X1),X1) ),
co1_12 ).
cnf(c_0_35,negated_conjecture,
leq(sk5(sk8,sk7,sk6),sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_20]),c_0_21]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SWC220-1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n003.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 02:07:33 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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.vqPTnCirfl/E---3.1_30366.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # new_bool_3 with pid 30444 completed with status 0
% 0.16/0.45 # Result found by new_bool_3
% 0.16/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 181s (1) cores
% 0.16/0.45 # G-E--_208_B07_F1_SE_CS_SP_PS_S4d with pid 30447 completed with status 0
% 0.16/0.45 # Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S4d
% 0.16/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 181s (1) cores
% 0.16/0.45 # Preprocessing time : 0.003 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Unsatisfiable
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 202
% 0.16/0.45 # Removed by relevancy pruning/SinE : 149
% 0.16/0.45 # Initial clauses : 53
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 53
% 0.16/0.45 # Processed clauses : 210
% 0.16/0.45 # ...of these trivial : 2
% 0.16/0.45 # ...subsumed : 45
% 0.16/0.45 # ...remaining for further processing : 163
% 0.16/0.45 # Other redundant clauses eliminated : 9
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 6
% 0.16/0.45 # Backward-rewritten : 4
% 0.16/0.45 # Generated clauses : 267
% 0.16/0.45 # ...of the previous two non-redundant : 237
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 4
% 0.16/0.45 # Paramodulations : 255
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 13
% 0.16/0.45 # Total rewrite steps : 242
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 100
% 0.16/0.45 # Positive orientable unit clauses : 16
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 1
% 0.16/0.45 # Non-unit-clauses : 83
% 0.16/0.45 # Current number of unprocessed clauses: 122
% 0.16/0.45 # ...number of literals in the above : 605
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 59
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 1544
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 384
% 0.16/0.45 # Non-unit clause-clause subsumptions : 51
% 0.16/0.45 # Unit Clause-clause subsumption calls : 12
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 4
% 0.16/0.45 # BW rewrite match successes : 4
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 8762
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.013 s
% 0.16/0.45 # System time : 0.005 s
% 0.16/0.45 # Total time : 0.018 s
% 0.16/0.45 # Maximum resident set size: 1952 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.016 s
% 0.16/0.45 # System time : 0.007 s
% 0.16/0.45 # Total time : 0.023 s
% 0.16/0.45 # Maximum resident set size: 1856 pages
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------