TSTP Solution File: SWC028+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC028+1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:27:04 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 10 unt; 0 def)
% Number of atoms : 108 ( 54 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 126 ( 46 ~; 45 |; 19 &)
% ( 3 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 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 : 20 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax52,axiom,
! [X1] :
( ssList(X1)
=> ( rearsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax52) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_5,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk1_0
| nil = esk2_0 )
& ( nil != esk2_0
| nil = esk2_0 )
& ( nil = esk1_0
| nil != esk1_0 )
& ( nil != esk2_0
| nil != esk1_0 )
& ( neq(esk3_0,nil)
| nil = esk4_0 )
& ( rearsegP(esk4_0,esk3_0)
| nil = esk4_0 )
& ( neq(esk3_0,nil)
| nil = esk3_0 )
& ( rearsegP(esk4_0,esk3_0)
| nil = esk3_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
cnf(c_0_6,negated_conjecture,
( nil = esk1_0
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X25] :
( ( ~ rearsegP(nil,X25)
| nil = X25
| ~ ssList(X25) )
& ( nil != X25
| rearsegP(nil,X25)
| ~ ssList(X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax52])])])]) ).
cnf(c_0_10,negated_conjecture,
( rearsegP(esk4_0,esk3_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( esk4_0 = nil
| esk3_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_12,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_13,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_14,negated_conjecture,
( nil != esk2_0
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( nil = X1
| ~ rearsegP(nil,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( esk3_0 = nil
| rearsegP(nil,esk3_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_12,c_0_7]) ).
fof(c_0_18,plain,
! [X28,X29] :
( ( ~ neq(X28,X29)
| X28 != X29
| ~ ssList(X29)
| ~ ssList(X28) )
& ( X28 = X29
| neq(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).
cnf(c_0_19,negated_conjecture,
( esk3_0 != nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_7]),c_0_8]) ).
cnf(c_0_20,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_21,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( neq(esk3_0,nil)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,negated_conjecture,
esk4_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
neq(nil,nil),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_20]),c_0_23]) ).
cnf(c_0_26,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC028+1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 03:06:37 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 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/benchmark/theBenchmark.p
% 0.19/0.48 # Version: 3.1.0
% 0.19/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # new_bool_3 with pid 28912 completed with status 0
% 0.19/0.48 # Result found by new_bool_3
% 0.19/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.19/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 28915 completed with status 0
% 0.19/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.19/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.19/0.48 # Preprocessing time : 0.002 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 96
% 0.19/0.48 # Removed by relevancy pruning/SinE : 70
% 0.19/0.48 # Initial clauses : 51
% 0.19/0.48 # Removed in clause preprocessing : 2
% 0.19/0.48 # Initial clauses in saturation : 49
% 0.19/0.48 # Processed clauses : 90
% 0.19/0.48 # ...of these trivial : 2
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 88
% 0.19/0.48 # Other redundant clauses eliminated : 6
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 9
% 0.19/0.48 # Generated clauses : 15
% 0.19/0.48 # ...of the previous two non-redundant : 12
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 1
% 0.19/0.48 # Paramodulations : 10
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 6
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 33
% 0.19/0.48 # ...of those cached : 26
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 27
% 0.19/0.48 # Positive orientable unit clauses : 11
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 2
% 0.19/0.48 # Non-unit-clauses : 14
% 0.19/0.48 # Current number of unprocessed clauses: 17
% 0.19/0.48 # ...number of literals in the above : 74
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 56
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 275
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 94
% 0.19/0.48 # Non-unit clause-clause subsumptions : 1
% 0.19/0.48 # Unit Clause-clause subsumption calls : 7
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 1
% 0.19/0.48 # BW rewrite match successes : 1
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 4972
% 0.19/0.48 # Search garbage collected termcells : 1476
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.009 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.011 s
% 0.19/0.48 # Maximum resident set size: 1904 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.011 s
% 0.19/0.48 # System time : 0.005 s
% 0.19/0.48 # Total time : 0.016 s
% 0.19/0.48 # Maximum resident set size: 1824 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------