TSTP Solution File: SWC317-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC317-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:33 EDT 2023
% Result : Unsatisfiable 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 11 unt; 1 nHn; 25 RR)
% Number of literals : 47 ( 16 equ; 24 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 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 : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/tmp/tmp.x6JRcjMysc/E---3.1_15130.p',co1_7) ).
cnf(co1_15,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.x6JRcjMysc/E---3.1_15130.p',co1_15) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.x6JRcjMysc/E---3.1_15130.p',co1_5) ).
cnf(co1_16,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.x6JRcjMysc/E---3.1_15130.p',co1_16) ).
cnf(co1_14,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk1
| app(X2,cons(X1,nil)) != sk2
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.x6JRcjMysc/E---3.1_15130.p',co1_14) ).
cnf(co1_18,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.x6JRcjMysc/E---3.1_15130.p',co1_18) ).
cnf(co1_17,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.x6JRcjMysc/E---3.1_15130.p',co1_17) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.x6JRcjMysc/E---3.1_15130.p',co1_6) ).
cnf(c_0_8,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_9,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
co1_15 ).
cnf(c_0_10,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_11,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
co1_16 ).
cnf(c_0_12,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk1
| app(X2,cons(X1,nil)) != sk2
| ~ neq(sk4,nil) ),
co1_14 ).
cnf(c_0_13,negated_conjecture,
neq(sk2,nil),
c_0_8 ).
cnf(c_0_14,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
co1_18 ).
cnf(c_0_15,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk3
| ~ neq(sk4,nil) ),
co1_17 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk2,nil) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_18,negated_conjecture,
( ssList(sk6)
| ~ neq(sk2,nil) ),
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_19,negated_conjecture,
( app(X1,cons(X2,nil)) != sk2
| app(cons(X2,nil),X1) != sk1
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10]),c_0_13])]) ).
cnf(c_0_20,negated_conjecture,
app(sk6,cons(sk5,nil)) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_10]),c_0_10]),c_0_13])]) ).
cnf(c_0_21,negated_conjecture,
app(cons(sk5,nil),sk6) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_10]),c_0_13])]) ).
cnf(c_0_22,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_13])]) ).
cnf(c_0_23,negated_conjecture,
ssList(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_13])]) ).
cnf(c_0_24,negated_conjecture,
$false,
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])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWC317-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 02:03:54 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.52 Running first-order model finding
% 0.21/0.52 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.x6JRcjMysc/E---3.1_15130.p
% 0.21/0.54 # Version: 3.1pre001
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # new_bool_3 with pid 15216 completed with status 0
% 0.21/0.54 # Result found by new_bool_3
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.54 # SAT001_MinMin_p005000_rr_RG with pid 15219 completed with status 0
% 0.21/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.54 # Preprocessing time : 0.004 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Unsatisfiable
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 203
% 0.21/0.54 # Removed by relevancy pruning/SinE : 164
% 0.21/0.54 # Initial clauses : 39
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 39
% 0.21/0.54 # Processed clauses : 72
% 0.21/0.54 # ...of these trivial : 8
% 0.21/0.54 # ...subsumed : 0
% 0.21/0.54 # ...remaining for further processing : 64
% 0.21/0.54 # Other redundant clauses eliminated : 4
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 2
% 0.21/0.54 # Backward-rewritten : 2
% 0.21/0.54 # Generated clauses : 21
% 0.21/0.54 # ...of the previous two non-redundant : 13
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 18
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 4
% 0.21/0.54 # Total rewrite steps : 53
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 26
% 0.21/0.54 # Positive orientable unit clauses : 11
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 0
% 0.21/0.54 # Non-unit-clauses : 15
% 0.21/0.54 # Current number of unprocessed clauses: 11
% 0.21/0.54 # ...number of literals in the above : 43
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 35
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 88
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 31
% 0.21/0.54 # Non-unit clause-clause subsumptions : 2
% 0.21/0.54 # Unit Clause-clause subsumption calls : 0
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 1
% 0.21/0.54 # BW rewrite match successes : 1
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 2991
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.006 s
% 0.21/0.54 # System time : 0.004 s
% 0.21/0.54 # Total time : 0.010 s
% 0.21/0.54 # Maximum resident set size: 1948 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.010 s
% 0.21/0.54 # System time : 0.006 s
% 0.21/0.54 # Total time : 0.016 s
% 0.21/0.54 # Maximum resident set size: 1848 pages
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------