TSTP Solution File: SWC103+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC103+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:30 EDT 2023
% Result : Theorem 0.17s 0.43s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 7 unt; 0 def)
% Number of atoms : 58 ( 14 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 69 ( 25 ~; 20 |; 16 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 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 : 8 ( 0 sgn; 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ( nil != X3
& nil = X4 )
| ( neq(X1,nil)
& frontsegP(X2,X1) )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ frontsegP(X4,X3) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nTbTNSo69B/E---3.1_2448.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ( nil != X3
& nil = X4 )
| ( neq(X1,nil)
& frontsegP(X2,X1) )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ frontsegP(X4,X3) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_2,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& neq(esk2_0,nil)
& ( nil = esk3_0
| nil != esk4_0 )
& ( ~ neq(esk1_0,nil)
| ~ frontsegP(esk2_0,esk1_0) )
& ( neq(esk3_0,nil)
| ~ neq(esk4_0,nil) )
& ( frontsegP(esk4_0,esk3_0)
| ~ neq(esk4_0,nil) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( ~ neq(esk1_0,nil)
| ~ frontsegP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( frontsegP(esk4_0,esk3_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( ~ frontsegP(esk4_0,esk3_0)
| ~ neq(esk3_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_4]),c_0_6]) ).
cnf(c_0_10,negated_conjecture,
frontsegP(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_11,negated_conjecture,
( neq(esk3_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
~ neq(esk3_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_8])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SWC103+1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n017.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 01:20:12 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.17/0.42 Running first-order model finding
% 0.17/0.42 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.nTbTNSo69B/E---3.1_2448.p
% 0.17/0.43 # Version: 3.1pre001
% 0.17/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.43 # Starting sh5l with 300s (1) cores
% 0.17/0.43 # new_bool_1 with pid 2527 completed with status 0
% 0.17/0.43 # Result found by new_bool_1
% 0.17/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.43 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.17/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.17/0.43 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 2530 completed with status 0
% 0.17/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.17/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.43 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.17/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.17/0.43 # Preprocessing time : 0.002 s
% 0.17/0.43 # Presaturation interreduction done
% 0.17/0.43
% 0.17/0.43 # Proof found!
% 0.17/0.43 # SZS status Theorem
% 0.17/0.43 # SZS output start CNFRefutation
% See solution above
% 0.17/0.43 # Parsed axioms : 96
% 0.17/0.43 # Removed by relevancy pruning/SinE : 69
% 0.17/0.43 # Initial clauses : 51
% 0.17/0.43 # Removed in clause preprocessing : 0
% 0.17/0.43 # Initial clauses in saturation : 51
% 0.17/0.43 # Processed clauses : 16
% 0.17/0.43 # ...of these trivial : 2
% 0.17/0.43 # ...subsumed : 0
% 0.17/0.43 # ...remaining for further processing : 13
% 0.17/0.43 # Other redundant clauses eliminated : 0
% 0.17/0.43 # Clauses deleted for lack of memory : 0
% 0.17/0.43 # Backward-subsumed : 0
% 0.17/0.43 # Backward-rewritten : 1
% 0.17/0.43 # Generated clauses : 0
% 0.17/0.43 # ...of the previous two non-redundant : 1
% 0.17/0.43 # ...aggressively subsumed : 0
% 0.17/0.43 # Contextual simplify-reflections : 0
% 0.17/0.43 # Paramodulations : 0
% 0.17/0.43 # Factorizations : 0
% 0.17/0.43 # NegExts : 0
% 0.17/0.43 # Equation resolutions : 0
% 0.17/0.43 # Total rewrite steps : 11
% 0.17/0.43 # Propositional unsat checks : 0
% 0.17/0.43 # Propositional check models : 0
% 0.17/0.43 # Propositional check unsatisfiable : 0
% 0.17/0.43 # Propositional clauses : 0
% 0.17/0.43 # Propositional clauses after purity: 0
% 0.17/0.43 # Propositional unsat core size : 0
% 0.17/0.43 # Propositional preprocessing time : 0.000
% 0.17/0.43 # Propositional encoding time : 0.000
% 0.17/0.43 # Propositional solver time : 0.000
% 0.17/0.43 # Success case prop preproc time : 0.000
% 0.17/0.43 # Success case prop encoding time : 0.000
% 0.17/0.43 # Success case prop solver time : 0.000
% 0.17/0.43 # Current number of processed clauses : 12
% 0.17/0.43 # Positive orientable unit clauses : 9
% 0.17/0.43 # Positive unorientable unit clauses: 0
% 0.17/0.43 # Negative unit clauses : 2
% 0.17/0.43 # Non-unit-clauses : 1
% 0.17/0.43 # Current number of unprocessed clauses: 36
% 0.17/0.43 # ...number of literals in the above : 145
% 0.17/0.43 # Current number of archived formulas : 0
% 0.17/0.43 # Current number of archived clauses : 1
% 0.17/0.43 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.43 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.43 # Non-unit clause-clause subsumptions : 0
% 0.17/0.43 # Unit Clause-clause subsumption calls : 1
% 0.17/0.43 # Rewrite failures with RHS unbound : 0
% 0.17/0.43 # BW rewrite match attempts : 1
% 0.17/0.43 # BW rewrite match successes : 1
% 0.17/0.43 # Condensation attempts : 0
% 0.17/0.43 # Condensation successes : 0
% 0.17/0.43 # Termbank termtop insertions : 4010
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.003 s
% 0.17/0.43 # System time : 0.003 s
% 0.17/0.43 # Total time : 0.006 s
% 0.17/0.43 # Maximum resident set size: 1912 pages
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.006 s
% 0.17/0.43 # System time : 0.005 s
% 0.17/0.43 # Total time : 0.011 s
% 0.17/0.43 # Maximum resident set size: 1800 pages
% 0.17/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------