TSTP Solution File: SWC016+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC016+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:03 EDT 2023
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 8 unt; 0 def)
% Number of atoms : 137 ( 40 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 168 ( 65 ~; 66 |; 26 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 21 ( 0 sgn; 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ frontsegP(X4,X5)
| ~ frontsegP(X3,X5) ) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& frontsegP(X2,X6)
& frontsegP(X1,X6) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NxstSUeT9w/E---3.1_31813.p',co1) ).
fof(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox/tmp/tmp.NxstSUeT9w/E---3.1_31813.p',ax45) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.NxstSUeT9w/E---3.1_31813.p',ax17) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ frontsegP(X4,X5)
| ~ frontsegP(X3,X5) ) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& frontsegP(X2,X6)
& frontsegP(X1,X6) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_4,negated_conjecture,
! [X12] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssList(esk5_0)
| ~ neq(esk4_0,nil) )
& ( neq(esk5_0,nil)
| ~ neq(esk4_0,nil) )
& ( frontsegP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) )
& ( frontsegP(esk3_0,esk5_0)
| ~ neq(esk4_0,nil) )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ frontsegP(esk2_0,X12)
| ~ frontsegP(esk1_0,X12)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ frontsegP(esk2_0,X12)
| ~ frontsegP(esk1_0,X12)
| nil != esk1_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_5,negated_conjecture,
( frontsegP(esk3_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( neq(esk2_0,nil)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( nil = esk2_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk2_0,X1)
| ~ frontsegP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( frontsegP(esk1_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( esk4_0 = nil
| neq(esk4_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( neq(esk5_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( ssList(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
( frontsegP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
( esk4_0 = nil
| ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8]),c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( esk4_0 = nil
| frontsegP(esk1_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( esk4_0 = nil
| neq(esk5_0,nil) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_19,negated_conjecture,
( esk4_0 = nil
| ssList(esk5_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( esk4_0 = nil
| frontsegP(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk2_0,X1)
| ~ frontsegP(esk1_0,X1)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,negated_conjecture,
( esk1_0 = nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_23,negated_conjecture,
esk4_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( esk1_0 != nil
| ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[c_0_21,c_0_8]) ).
cnf(c_0_25,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
fof(c_0_26,plain,
! [X30] :
( ~ ssList(X30)
| frontsegP(X30,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
cnf(c_0_27,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_28,negated_conjecture,
( ~ frontsegP(nil,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_23]),c_0_25]),c_0_25])]) ).
cnf(c_0_29,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_31,negated_conjecture,
( neq(esk4_0,nil)
| esk1_0 != nil ),
inference(rw,[status(thm)],[c_0_27,c_0_8]) ).
cnf(c_0_32,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_23]),c_0_25])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SWC016+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n023.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Oct 3 02:05:37 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.NxstSUeT9w/E---3.1_31813.p
% 0.15/0.42 # Version: 3.1pre001
% 0.15/0.42 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # new_bool_3 with pid 31891 completed with status 0
% 0.15/0.42 # Result found by new_bool_3
% 0.15/0.42 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.15/0.42 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 31894 completed with status 0
% 0.15/0.42 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.15/0.42 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.15/0.42 # Preprocessing time : 0.002 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 96
% 0.15/0.42 # Removed by relevancy pruning/SinE : 69
% 0.15/0.42 # Initial clauses : 55
% 0.15/0.42 # Removed in clause preprocessing : 0
% 0.15/0.42 # Initial clauses in saturation : 55
% 0.15/0.42 # Processed clauses : 113
% 0.15/0.42 # ...of these trivial : 2
% 0.15/0.42 # ...subsumed : 2
% 0.15/0.42 # ...remaining for further processing : 108
% 0.15/0.42 # Other redundant clauses eliminated : 7
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 1
% 0.15/0.42 # Backward-rewritten : 19
% 0.15/0.42 # Generated clauses : 22
% 0.15/0.42 # ...of the previous two non-redundant : 26
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 4
% 0.15/0.42 # Paramodulations : 16
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 7
% 0.15/0.42 # Total rewrite steps : 56
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 29
% 0.15/0.42 # Positive orientable unit clauses : 9
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 2
% 0.15/0.42 # Non-unit-clauses : 18
% 0.15/0.42 # Current number of unprocessed clauses: 21
% 0.15/0.42 # ...number of literals in the above : 88
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 73
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 318
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 113
% 0.15/0.42 # Non-unit clause-clause subsumptions : 5
% 0.15/0.42 # Unit Clause-clause subsumption calls : 19
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 2
% 0.15/0.42 # BW rewrite match successes : 2
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 5175
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.007 s
% 0.15/0.42 # System time : 0.004 s
% 0.15/0.42 # Total time : 0.010 s
% 0.15/0.42 # Maximum resident set size: 1920 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.009 s
% 0.15/0.42 # System time : 0.006 s
% 0.15/0.42 # Total time : 0.015 s
% 0.15/0.42 # Maximum resident set size: 1800 pages
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------