TSTP Solution File: SWC324+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC324+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:29:03 EDT 2024
% Result : Theorem 0.74s 0.57s
% Output : CNFRefutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 12 unt; 0 def)
% Number of atoms : 159 ( 69 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 199 ( 80 ~; 76 |; 29 &)
% ( 1 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 26 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(X5,X6) = X2
& app(X6,X5) = X1 ) )
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) != X3
& app(cons(X7,nil),X8) = X4 ) )
| ( nil != X3
& nil = X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(X5,X6) = X2
& app(X6,X5) = X1 ) )
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) != X3
& app(cons(X7,nil),X8) = X4 ) )
| ( nil != X3
& nil = X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_7,negated_conjecture,
! [X13,X14,X15,X16] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ~ ssList(X13)
| ~ ssList(X14)
| app(X13,X14) != esk2_0
| app(X14,X13) != esk1_0 )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(X16,cons(X15,nil)) = esk3_0
| app(cons(X15,nil),X16) != esk4_0 )
& ( nil = esk3_0
| nil != esk4_0 ) ),
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_6])])])])]) ).
fof(c_0_8,plain,
! [X39,X40] :
( ( nil = X40
| nil != app(X39,X40)
| ~ ssList(X40)
| ~ ssList(X39) )
& ( nil = X39
| nil != app(X39,X40)
| ~ ssList(X40)
| ~ ssList(X39) )
& ( nil != X40
| nil != X39
| nil = app(X39,X40)
| ~ ssList(X40)
| ~ ssList(X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
fof(c_0_9,plain,
! [X34,X35] :
( ~ ssList(X34)
| ~ ssItem(X35)
| cons(X35,X34) = app(cons(X35,nil),X34) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != esk2_0
| app(X2,X1) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( nil = app(X2,X1)
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_15,negated_conjecture,
( app(X2,cons(X1,nil)) = esk3_0
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_17,plain,
! [X17] :
( ( ssList(esk5_1(X17))
| nil = X17
| ~ ssList(X17) )
& ( ssItem(esk6_1(X17))
| nil = X17
| ~ ssList(X17) )
& ( cons(esk6_1(X17),esk5_1(X17)) = X17
| nil = X17
| ~ ssList(X17) ) ),
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_18,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( app(X1,X2) != esk3_0
| app(X2,X1) != esk4_0
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_20,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_13])]),c_0_14])]) ).
cnf(c_0_21,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
( app(X1,cons(X2,nil)) = esk3_0
| cons(X2,X1) != esk4_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( cons(esk6_1(X1),esk5_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_25,negated_conjecture,
esk4_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_20]),c_0_14])]),c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( app(esk5_1(esk4_0),cons(esk6_1(esk4_0),nil)) = esk3_0
| ~ ssList(esk5_1(esk4_0))
| ~ ssItem(esk6_1(esk4_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23])]),c_0_24])]),c_0_25]) ).
cnf(c_0_27,plain,
( ssItem(esk6_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,negated_conjecture,
( app(esk5_1(esk4_0),cons(esk6_1(esk4_0),nil)) = esk3_0
| ~ ssList(esk5_1(esk4_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24])]),c_0_25]) ).
cnf(c_0_29,plain,
( ssList(esk5_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,negated_conjecture,
app(esk5_1(esk4_0),cons(esk6_1(esk4_0),nil)) = esk3_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_24])]),c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( app(cons(esk6_1(esk4_0),nil),esk5_1(esk4_0)) != esk4_0
| ~ ssList(cons(esk6_1(esk4_0),nil))
| ~ ssList(esk5_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
( cons(esk6_1(esk4_0),esk5_1(esk4_0)) != esk4_0
| ~ ssList(cons(esk6_1(esk4_0),nil))
| ~ ssList(esk5_1(esk4_0))
| ~ ssItem(esk6_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_31,c_0_16]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(cons(esk6_1(esk4_0),nil))
| ~ ssList(esk5_1(esk4_0))
| ~ ssItem(esk6_1(esk4_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(cons(esk6_1(esk4_0),nil))
| ~ ssList(esk5_1(esk4_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_27]),c_0_24])]),c_0_25]) ).
fof(c_0_35,plain,
! [X42,X43] :
( ~ ssList(X42)
| ~ ssItem(X43)
| ssList(cons(X43,X42)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_36,negated_conjecture,
~ ssList(cons(esk6_1(esk4_0),nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_29]),c_0_24])]),c_0_25]) ).
cnf(c_0_37,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_38,negated_conjecture,
~ ssItem(esk6_1(esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_14])]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_27]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC324+1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n004.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 03:54:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 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.49/0.57 # Version: 3.1.0
% 0.49/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.49/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.49/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.49/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.49/0.57 # Starting sh5l with 300s (1) cores
% 0.49/0.57 # new_bool_3 with pid 4862 completed with status 0
% 0.49/0.57 # Result found by new_bool_3
% 0.49/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.49/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.49/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.49/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.49/0.57 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.49/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.49/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.49/0.57 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 4866 completed with status 0
% 0.49/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.49/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.74/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.74/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.74/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.74/0.57 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.74/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.74/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.74/0.57 # Preprocessing time : 0.002 s
% 0.74/0.57 # Presaturation interreduction done
% 0.74/0.57
% 0.74/0.57 # Proof found!
% 0.74/0.57 # SZS status Theorem
% 0.74/0.57 # SZS output start CNFRefutation
% See solution above
% 0.74/0.57 # Parsed axioms : 96
% 0.74/0.57 # Removed by relevancy pruning/SinE : 79
% 0.74/0.57 # Initial clauses : 32
% 0.74/0.57 # Removed in clause preprocessing : 0
% 0.74/0.57 # Initial clauses in saturation : 32
% 0.74/0.57 # Processed clauses : 140
% 0.74/0.57 # ...of these trivial : 2
% 0.74/0.57 # ...subsumed : 35
% 0.74/0.57 # ...remaining for further processing : 103
% 0.74/0.57 # Other redundant clauses eliminated : 14
% 0.74/0.57 # Clauses deleted for lack of memory : 0
% 0.74/0.57 # Backward-subsumed : 10
% 0.74/0.57 # Backward-rewritten : 1
% 0.74/0.57 # Generated clauses : 191
% 0.74/0.57 # ...of the previous two non-redundant : 149
% 0.74/0.57 # ...aggressively subsumed : 0
% 0.74/0.57 # Contextual simplify-reflections : 11
% 0.74/0.57 # Paramodulations : 174
% 0.74/0.57 # Factorizations : 0
% 0.74/0.57 # NegExts : 0
% 0.74/0.57 # Equation resolutions : 18
% 0.74/0.57 # Disequality decompositions : 0
% 0.74/0.57 # Total rewrite steps : 106
% 0.74/0.57 # ...of those cached : 99
% 0.74/0.57 # Propositional unsat checks : 0
% 0.74/0.57 # Propositional check models : 0
% 0.74/0.57 # Propositional check unsatisfiable : 0
% 0.74/0.57 # Propositional clauses : 0
% 0.74/0.57 # Propositional clauses after purity: 0
% 0.74/0.57 # Propositional unsat core size : 0
% 0.74/0.57 # Propositional preprocessing time : 0.000
% 0.74/0.57 # Propositional encoding time : 0.000
% 0.74/0.57 # Propositional solver time : 0.000
% 0.74/0.57 # Success case prop preproc time : 0.000
% 0.74/0.57 # Success case prop encoding time : 0.000
% 0.74/0.57 # Success case prop solver time : 0.000
% 0.74/0.57 # Current number of processed clauses : 61
% 0.74/0.57 # Positive orientable unit clauses : 9
% 0.74/0.57 # Positive unorientable unit clauses: 0
% 0.74/0.57 # Negative unit clauses : 7
% 0.74/0.57 # Non-unit-clauses : 45
% 0.74/0.57 # Current number of unprocessed clauses: 71
% 0.74/0.57 # ...number of literals in the above : 404
% 0.74/0.57 # Current number of archived formulas : 0
% 0.74/0.57 # Current number of archived clauses : 41
% 0.74/0.57 # Clause-clause subsumption calls (NU) : 719
% 0.74/0.57 # Rec. Clause-clause subsumption calls : 225
% 0.74/0.57 # Non-unit clause-clause subsumptions : 50
% 0.74/0.57 # Unit Clause-clause subsumption calls : 60
% 0.74/0.57 # Rewrite failures with RHS unbound : 0
% 0.74/0.57 # BW rewrite match attempts : 1
% 0.74/0.57 # BW rewrite match successes : 1
% 0.74/0.57 # Condensation attempts : 0
% 0.74/0.57 # Condensation successes : 0
% 0.74/0.57 # Termbank termtop insertions : 6824
% 0.74/0.57 # Search garbage collected termcells : 1278
% 0.74/0.57
% 0.74/0.57 # -------------------------------------------------
% 0.74/0.57 # User time : 0.012 s
% 0.74/0.57 # System time : 0.003 s
% 0.74/0.57 # Total time : 0.015 s
% 0.74/0.57 # Maximum resident set size: 1884 pages
% 0.74/0.57
% 0.74/0.57 # -------------------------------------------------
% 0.74/0.57 # User time : 0.015 s
% 0.74/0.57 # System time : 0.005 s
% 0.74/0.57 # Total time : 0.021 s
% 0.74/0.57 # Maximum resident set size: 1824 pages
% 0.74/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------