TSTP Solution File: SWC046+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC046+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:15 EDT 2024
% Result : Theorem 0.15s 0.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 13 unt; 0 def)
% Number of atoms : 136 ( 33 equ)
% Maximal formula atoms : 23 ( 4 avg)
% Number of connectives : 165 ( 60 ~; 61 |; 27 &)
% ( 1 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 23 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ! [X6] :
( ssList(X6)
=> ~ segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) )
& memberP(X4,X5) )
| ( memberP(X3,X5)
& ( ~ memberP(X4,X5)
| ? [X6] :
( ssList(X6)
& segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ! [X6] :
( ssList(X6)
=> ~ segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) )
& memberP(X4,X5) )
| ( memberP(X3,X5)
& ( ~ memberP(X4,X5)
| ? [X6] :
( ssList(X6)
& segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_5,negated_conjecture,
! [X11,X13] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& nil = esk2_0
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& nil != esk1_0
& ( ssList(esk5_1(X11))
| memberP(esk3_0,X11)
| ~ memberP(esk4_0,X11)
| ~ ssItem(X11) )
& ( segmentP(esk4_0,app(app(cons(X11,nil),esk5_1(X11)),cons(X11,nil)))
| memberP(esk3_0,X11)
| ~ memberP(esk4_0,X11)
| ~ ssItem(X11) )
& ( memberP(esk4_0,X11)
| ~ memberP(esk3_0,X11)
| ~ ssItem(X11) )
& ( ~ ssList(X13)
| ~ segmentP(esk4_0,app(app(cons(X11,nil),X13),cons(X11,nil)))
| ~ memberP(esk3_0,X11)
| ~ ssItem(X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
fof(c_0_6,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_7,plain,
! [X74,X75,X76] :
( ( ~ memberP(cons(X75,X76),X74)
| X74 = X75
| memberP(X76,X74)
| ~ ssList(X76)
| ~ ssItem(X75)
| ~ ssItem(X74) )
& ( X74 != X75
| memberP(cons(X75,X76),X74)
| ~ ssList(X76)
| ~ ssItem(X75)
| ~ ssItem(X74) )
& ( ~ memberP(X76,X74)
| memberP(cons(X75,X76),X74)
| ~ ssList(X76)
| ~ ssItem(X75)
| ~ ssItem(X74) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])])]) ).
fof(c_0_8,plain,
! [X60] :
( ( ssList(esk8_1(X60))
| nil = X60
| ~ ssList(X60) )
& ( ssItem(esk9_1(X60))
| nil = X60
| ~ ssList(X60) )
& ( cons(esk9_1(X60),esk8_1(X60)) = X60
| nil = X60
| ~ ssList(X60) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_9,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
nil = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_14,plain,
! [X77] :
( ~ ssItem(X77)
| ~ memberP(nil,X77) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_15,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( cons(esk9_1(X1),esk8_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_18,negated_conjecture,
esk3_0 != nil,
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_19,plain,
( ssList(esk8_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
( ssItem(esk9_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( memberP(esk4_0,X1)
| ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,negated_conjecture,
esk4_0 = nil,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_23,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
cons(esk9_1(esk3_0),esk8_1(esk3_0)) = esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk8_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_18]) ).
cnf(c_0_27,negated_conjecture,
ssItem(esk9_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_18]) ).
cnf(c_0_28,negated_conjecture,
( ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_29,negated_conjecture,
memberP(esk3_0,esk9_1(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWC046+1 : TPTP v8.2.0. Released v2.4.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n022.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 : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 02:50:52 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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/benchmark/theBenchmark.p
% 0.15/0.47 # Version: 3.1.0
% 0.15/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 # Starting sh5l with 300s (1) cores
% 0.15/0.47 # new_bool_3 with pid 24191 completed with status 0
% 0.15/0.47 # Result found by new_bool_3
% 0.15/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.47 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.15/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24195 completed with status 0
% 0.15/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.47 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.15/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.47 # Preprocessing time : 0.001 s
% 0.15/0.47 # Presaturation interreduction done
% 0.15/0.47
% 0.15/0.47 # Proof found!
% 0.15/0.47 # SZS status Theorem
% 0.15/0.47 # SZS output start CNFRefutation
% See solution above
% 0.15/0.47 # Parsed axioms : 96
% 0.15/0.47 # Removed by relevancy pruning/SinE : 68
% 0.15/0.47 # Initial clauses : 57
% 0.15/0.47 # Removed in clause preprocessing : 0
% 0.15/0.47 # Initial clauses in saturation : 57
% 0.15/0.47 # Processed clauses : 104
% 0.15/0.47 # ...of these trivial : 3
% 0.15/0.47 # ...subsumed : 5
% 0.15/0.47 # ...remaining for further processing : 96
% 0.15/0.47 # Other redundant clauses eliminated : 6
% 0.15/0.47 # Clauses deleted for lack of memory : 0
% 0.15/0.47 # Backward-subsumed : 0
% 0.15/0.47 # Backward-rewritten : 1
% 0.15/0.47 # Generated clauses : 40
% 0.15/0.47 # ...of the previous two non-redundant : 34
% 0.15/0.47 # ...aggressively subsumed : 0
% 0.15/0.47 # Contextual simplify-reflections : 1
% 0.15/0.47 # Paramodulations : 35
% 0.15/0.47 # Factorizations : 0
% 0.15/0.47 # NegExts : 0
% 0.15/0.47 # Equation resolutions : 6
% 0.15/0.47 # Disequality decompositions : 0
% 0.15/0.47 # Total rewrite steps : 32
% 0.15/0.47 # ...of those cached : 25
% 0.15/0.47 # Propositional unsat checks : 0
% 0.15/0.47 # Propositional check models : 0
% 0.15/0.47 # Propositional check unsatisfiable : 0
% 0.15/0.47 # Propositional clauses : 0
% 0.15/0.47 # Propositional clauses after purity: 0
% 0.15/0.47 # Propositional unsat core size : 0
% 0.15/0.47 # Propositional preprocessing time : 0.000
% 0.15/0.47 # Propositional encoding time : 0.000
% 0.15/0.47 # Propositional solver time : 0.000
% 0.15/0.47 # Success case prop preproc time : 0.000
% 0.15/0.47 # Success case prop encoding time : 0.000
% 0.15/0.47 # Success case prop solver time : 0.000
% 0.15/0.47 # Current number of processed clauses : 39
% 0.15/0.47 # Positive orientable unit clauses : 13
% 0.15/0.47 # Positive unorientable unit clauses: 0
% 0.15/0.47 # Negative unit clauses : 3
% 0.15/0.47 # Non-unit-clauses : 23
% 0.15/0.47 # Current number of unprocessed clauses: 38
% 0.15/0.47 # ...number of literals in the above : 174
% 0.15/0.47 # Current number of archived formulas : 0
% 0.15/0.47 # Current number of archived clauses : 52
% 0.15/0.47 # Clause-clause subsumption calls (NU) : 270
% 0.15/0.47 # Rec. Clause-clause subsumption calls : 74
% 0.15/0.47 # Non-unit clause-clause subsumptions : 5
% 0.15/0.47 # Unit Clause-clause subsumption calls : 33
% 0.15/0.47 # Rewrite failures with RHS unbound : 0
% 0.15/0.47 # BW rewrite match attempts : 1
% 0.15/0.47 # BW rewrite match successes : 1
% 0.15/0.47 # Condensation attempts : 0
% 0.15/0.47 # Condensation successes : 0
% 0.15/0.47 # Termbank termtop insertions : 6494
% 0.15/0.47 # Search garbage collected termcells : 1725
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.007 s
% 0.15/0.47 # System time : 0.005 s
% 0.15/0.47 # Total time : 0.011 s
% 0.15/0.47 # Maximum resident set size: 2032 pages
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.009 s
% 0.15/0.47 # System time : 0.007 s
% 0.15/0.47 # Total time : 0.016 s
% 0.15/0.47 # Maximum resident set size: 1820 pages
% 0.15/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------