TSTP Solution File: SWC330+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC330+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:25:45 EDT 2024
% Result : Theorem 0.59s 0.56s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 14 unt; 0 def)
% Number of atoms : 189 ( 62 equ)
% Maximal formula atoms : 44 ( 4 avg)
% Number of connectives : 222 ( 76 ~; 88 |; 38 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 32 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( segmentP(X2,X1)
& equalelemsP(X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax73,axiom,
! [X1] :
( ssItem(X1)
=> equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax73) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax74) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( segmentP(X2,X1)
& equalelemsP(X1) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_8,negated_conjecture,
! [X17,X18] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk4_0
| ssItem(esk5_0) )
& ( nil = esk3_0
| ssItem(esk5_0) )
& ( nil = esk4_0
| ssList(esk6_0) )
& ( nil = esk3_0
| ssList(esk6_0) )
& ( nil = esk4_0
| ssList(esk7_0) )
& ( nil = esk3_0
| ssList(esk7_0) )
& ( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk4_0
| app(app(esk6_0,esk3_0),esk7_0) = esk4_0 )
& ( nil = esk3_0
| app(app(esk6_0,esk3_0),esk7_0) = esk4_0 )
& ( nil = esk4_0
| ~ ssItem(X17)
| ~ memberP(esk6_0,X17)
| ~ lt(esk5_0,X17) )
& ( nil = esk3_0
| ~ ssItem(X17)
| ~ memberP(esk6_0,X17)
| ~ lt(esk5_0,X17) )
& ( nil = esk4_0
| ~ ssItem(X18)
| ~ memberP(esk7_0,X18)
| ~ lt(X18,esk5_0) )
& ( nil = esk3_0
| ~ ssItem(X18)
| ~ memberP(esk7_0,X18)
| ~ lt(X18,esk5_0) )
& ( ~ segmentP(esk2_0,esk1_0)
| ~ equalelemsP(esk1_0) ) ),
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_7])])])])])]) ).
fof(c_0_9,plain,
! [X28] :
( ~ ssItem(X28)
| equalelemsP(cons(X28,nil)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])])]) ).
fof(c_0_10,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
fof(c_0_11,plain,
! [X29,X30,X33,X34] :
( ( ssList(esk12_2(X29,X30))
| ~ segmentP(X29,X30)
| ~ ssList(X30)
| ~ ssList(X29) )
& ( ssList(esk13_2(X29,X30))
| ~ segmentP(X29,X30)
| ~ ssList(X30)
| ~ ssList(X29) )
& ( app(app(esk12_2(X29,X30),X30),esk13_2(X29,X30)) = X29
| ~ segmentP(X29,X30)
| ~ ssList(X30)
| ~ ssList(X29) )
& ( ~ ssList(X33)
| ~ ssList(X34)
| app(app(X33,X30),X34) != X29
| segmentP(X29,X30)
| ~ ssList(X30)
| ~ ssList(X29) ) ),
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)],[ax7])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ equalelemsP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( nil = esk3_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_18,plain,
! [X102,X103] :
( ~ ssList(X102)
| ~ ssItem(X103)
| cons(X103,X102) != X102 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_19,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,negated_conjecture,
( ~ equalelemsP(esk3_0)
| ~ segmentP(esk4_0,esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( esk3_0 = nil
| equalelemsP(esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_27,negated_conjecture,
( nil = esk4_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
( nil = esk3_0
| app(app(esk6_0,esk3_0),esk7_0) = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_32,negated_conjecture,
( nil = esk3_0
| ssList(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,negated_conjecture,
( nil = esk3_0
| ssList(esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_34,negated_conjecture,
( esk3_0 = nil
| ~ segmentP(esk4_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_35,plain,
! [X46] :
( ( ~ segmentP(nil,X46)
| nil = X46
| ~ ssList(X46) )
& ( nil != X46
| segmentP(nil,X46)
| ~ ssList(X46) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_36,negated_conjecture,
( esk4_0 = nil
| esk3_0 != nil ),
inference(csr,[status(thm)],[inference(cn,[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_37,negated_conjecture,
esk3_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]),c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_38,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,plain,
equalelemsP(nil),
inference(split_conjunct,[status(thm)],[ax74]) ).
cnf(c_0_40,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_41,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_26])]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_37]),c_0_39]),c_0_37])]),c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC330+1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 03:05:23 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.59/0.56 # Version: 3.1.0
% 0.59/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.59/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.59/0.56 # Starting sh5l with 300s (1) cores
% 0.59/0.56 # new_bool_3 with pid 8304 completed with status 0
% 0.59/0.56 # Result found by new_bool_3
% 0.59/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.59/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.59/0.56 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.59/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.59/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.59/0.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8307 completed with status 0
% 0.59/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.59/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.59/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.59/0.56 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.59/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.59/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.59/0.56 # Preprocessing time : 0.002 s
% 0.59/0.56 # Presaturation interreduction done
% 0.59/0.56
% 0.59/0.56 # Proof found!
% 0.59/0.56 # SZS status Theorem
% 0.59/0.56 # SZS output start CNFRefutation
% See solution above
% 0.59/0.56 # Parsed axioms : 96
% 0.59/0.56 # Removed by relevancy pruning/SinE : 56
% 0.59/0.56 # Initial clauses : 86
% 0.59/0.56 # Removed in clause preprocessing : 0
% 0.59/0.56 # Initial clauses in saturation : 86
% 0.59/0.56 # Processed clauses : 219
% 0.59/0.56 # ...of these trivial : 3
% 0.59/0.56 # ...subsumed : 3
% 0.59/0.56 # ...remaining for further processing : 212
% 0.59/0.56 # Other redundant clauses eliminated : 16
% 0.59/0.56 # Clauses deleted for lack of memory : 0
% 0.59/0.56 # Backward-subsumed : 0
% 0.59/0.56 # Backward-rewritten : 56
% 0.59/0.56 # Generated clauses : 409
% 0.59/0.56 # ...of the previous two non-redundant : 360
% 0.59/0.56 # ...aggressively subsumed : 0
% 0.59/0.56 # Contextual simplify-reflections : 10
% 0.59/0.56 # Paramodulations : 390
% 0.59/0.56 # Factorizations : 0
% 0.59/0.56 # NegExts : 0
% 0.59/0.56 # Equation resolutions : 20
% 0.59/0.56 # Disequality decompositions : 0
% 0.59/0.56 # Total rewrite steps : 200
% 0.59/0.56 # ...of those cached : 191
% 0.59/0.56 # Propositional unsat checks : 0
% 0.59/0.56 # Propositional check models : 0
% 0.59/0.56 # Propositional check unsatisfiable : 0
% 0.59/0.56 # Propositional clauses : 0
% 0.59/0.56 # Propositional clauses after purity: 0
% 0.59/0.56 # Propositional unsat core size : 0
% 0.59/0.56 # Propositional preprocessing time : 0.000
% 0.59/0.56 # Propositional encoding time : 0.000
% 0.59/0.56 # Propositional solver time : 0.000
% 0.59/0.56 # Success case prop preproc time : 0.000
% 0.59/0.56 # Success case prop encoding time : 0.000
% 0.59/0.56 # Success case prop solver time : 0.000
% 0.59/0.56 # Current number of processed clauses : 67
% 0.59/0.56 # Positive orientable unit clauses : 10
% 0.59/0.56 # Positive unorientable unit clauses: 0
% 0.59/0.56 # Negative unit clauses : 1
% 0.59/0.56 # Non-unit-clauses : 56
% 0.59/0.56 # Current number of unprocessed clauses: 309
% 0.59/0.56 # ...number of literals in the above : 1486
% 0.59/0.56 # Current number of archived formulas : 0
% 0.59/0.56 # Current number of archived clauses : 138
% 0.59/0.56 # Clause-clause subsumption calls (NU) : 1947
% 0.59/0.56 # Rec. Clause-clause subsumption calls : 573
% 0.59/0.56 # Non-unit clause-clause subsumptions : 13
% 0.59/0.56 # Unit Clause-clause subsumption calls : 13
% 0.59/0.56 # Rewrite failures with RHS unbound : 0
% 0.59/0.56 # BW rewrite match attempts : 2
% 0.59/0.56 # BW rewrite match successes : 2
% 0.59/0.56 # Condensation attempts : 0
% 0.59/0.56 # Condensation successes : 0
% 0.59/0.56 # Termbank termtop insertions : 14085
% 0.59/0.56 # Search garbage collected termcells : 2204
% 0.59/0.56
% 0.59/0.56 # -------------------------------------------------
% 0.59/0.56 # User time : 0.020 s
% 0.59/0.56 # System time : 0.004 s
% 0.59/0.56 # Total time : 0.024 s
% 0.59/0.56 # Maximum resident set size: 2052 pages
% 0.59/0.56
% 0.59/0.56 # -------------------------------------------------
% 0.59/0.56 # User time : 0.025 s
% 0.59/0.56 # System time : 0.005 s
% 0.59/0.56 # Total time : 0.030 s
% 0.59/0.56 # Maximum resident set size: 1828 pages
% 0.59/0.56 % E---3.1 exiting
% 0.72/0.56 % E exiting
%------------------------------------------------------------------------------