TSTP Solution File: SWC028-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC028-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:07 EDT 2023
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 13 unt; 8 nHn; 29 RR)
% Number of literals : 51 ( 27 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( nil = sk2
| nil = sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.6WcLc5CKjS/E---3.1_1212.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.6WcLc5CKjS/E---3.1_1212.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.6WcLc5CKjS/E---3.1_1212.p',co1_5) ).
cnf(co1_14,negated_conjecture,
( nil = sk3
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox2/tmp/tmp.6WcLc5CKjS/E---3.1_1212.p',co1_14) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.6WcLc5CKjS/E---3.1_1212.p',co1_1) ).
cnf(co1_10,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/tmp/tmp.6WcLc5CKjS/E---3.1_1212.p',co1_10) ).
cnf(clause82,axiom,
( nil = X1
| ~ rearsegP(nil,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6WcLc5CKjS/E---3.1_1212.p',clause82) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6WcLc5CKjS/E---3.1_1212.p',clause115) ).
cnf(co1_11,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.6WcLc5CKjS/E---3.1_1212.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.6WcLc5CKjS/E---3.1_1212.p',clause8) ).
cnf(c_0_10,negated_conjecture,
( nil = sk2
| nil = sk1 ),
co1_7 ).
cnf(c_0_11,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_12,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_13,negated_conjecture,
( nil = sk3
| rearsegP(sk4,sk3) ),
co1_14 ).
cnf(c_0_14,negated_conjecture,
( sk4 = nil
| sk3 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_16,negated_conjecture,
( nil != sk1
| nil != sk2 ),
co1_10 ).
cnf(c_0_17,axiom,
( nil = X1
| ~ rearsegP(nil,X1)
| ~ ssList(X1) ),
clause82 ).
cnf(c_0_18,negated_conjecture,
( sk3 = nil
| rearsegP(nil,sk3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( sk3 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_11]),c_0_12]) ).
cnf(c_0_21,negated_conjecture,
sk3 = 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_22,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_23,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
co1_11 ).
cnf(c_0_24,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_25,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
neq(nil,nil),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_21]),c_0_24]) ).
cnf(c_0_27,axiom,
ssList(nil),
clause8 ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC028-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 01:52:14 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.6WcLc5CKjS/E---3.1_1212.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # new_bool_3 with pid 1372 completed with status 0
% 0.20/0.52 # Result found by new_bool_3
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52 # SAT001_MinMin_p005000_rr_RG with pid 1375 completed with status 0
% 0.20/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52 # Preprocessing time : 0.003 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 199
% 0.20/0.52 # Removed by relevancy pruning/SinE : 156
% 0.20/0.52 # Initial clauses : 43
% 0.20/0.52 # Removed in clause preprocessing : 2
% 0.20/0.52 # Initial clauses in saturation : 41
% 0.20/0.52 # Processed clauses : 73
% 0.20/0.52 # ...of these trivial : 2
% 0.20/0.52 # ...subsumed : 0
% 0.20/0.52 # ...remaining for further processing : 71
% 0.20/0.52 # Other redundant clauses eliminated : 6
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 9
% 0.20/0.52 # Generated clauses : 11
% 0.20/0.52 # ...of the previous two non-redundant : 11
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 1
% 0.20/0.52 # Paramodulations : 6
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 6
% 0.20/0.52 # Total rewrite steps : 27
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 18
% 0.20/0.52 # Positive orientable unit clauses : 8
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 1
% 0.20/0.52 # Non-unit-clauses : 9
% 0.20/0.52 # Current number of unprocessed clauses: 18
% 0.20/0.52 # ...number of literals in the above : 76
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 48
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 240
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 67
% 0.20/0.52 # Non-unit clause-clause subsumptions : 1
% 0.20/0.52 # Unit Clause-clause subsumption calls : 2
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 1
% 0.20/0.52 # BW rewrite match successes : 1
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 2734
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.004 s
% 0.20/0.52 # System time : 0.005 s
% 0.20/0.52 # Total time : 0.010 s
% 0.20/0.52 # Maximum resident set size: 2020 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.007 s
% 0.20/0.52 # System time : 0.009 s
% 0.20/0.52 # Total time : 0.016 s
% 0.20/0.52 # Maximum resident set size: 1852 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------