TSTP Solution File: SWC106+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC106+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:39 EDT 2024
% Result : Theorem 0.20s 0.46s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 13 unt; 0 def)
% Number of atoms : 157 ( 34 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 191 ( 72 ~; 67 |; 25 &)
% ( 3 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 33 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X5,nil) != X3
| app(X6,cons(X5,nil)) != X4 ) ) )
| ( neq(X1,nil)
& rearsegP(X2,X1) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X5,nil) != X3
| app(X6,cons(X5,nil)) != X4 ) ) )
| ( neq(X1,nil)
& rearsegP(X2,X1) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_7,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ssItem(esk5_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk5_0) )
& ( neq(esk2_0,nil)
| ssList(esk6_0) )
& ( ~ neq(esk4_0,nil)
| ssList(esk6_0) )
& ( neq(esk2_0,nil)
| cons(esk5_0,nil) = esk3_0 )
& ( ~ neq(esk4_0,nil)
| cons(esk5_0,nil) = esk3_0 )
& ( neq(esk2_0,nil)
| app(esk6_0,cons(esk5_0,nil)) = esk4_0 )
& ( ~ neq(esk4_0,nil)
| app(esk6_0,cons(esk5_0,nil)) = esk4_0 )
& ( neq(esk2_0,nil)
| ~ neq(esk1_0,nil)
| ~ rearsegP(esk2_0,esk1_0) )
& ( ~ neq(esk4_0,nil)
| ~ neq(esk1_0,nil)
| ~ rearsegP(esk2_0,esk1_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_6])])])])]) ).
fof(c_0_8,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
cnf(c_0_9,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_11,plain,
! [X59,X60] :
( ~ ssList(X59)
| ~ ssItem(X60)
| cons(X60,X59) != X59 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_12,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_17,plain,
! [X22,X23,X25] :
( ( ssList(esk9_2(X22,X23))
| ~ rearsegP(X22,X23)
| ~ ssList(X23)
| ~ ssList(X22) )
& ( app(esk9_2(X22,X23),X23) = X22
| ~ rearsegP(X22,X23)
| ~ ssList(X23)
| ~ ssList(X22) )
& ( ~ ssList(X25)
| app(X25,X23) != X22
| rearsegP(X22,X23)
| ~ ssList(X23)
| ~ ssList(X22) ) ),
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)],[ax6])])])])])]) ).
fof(c_0_18,plain,
! [X37,X38] :
( ~ ssList(X37)
| ~ ssList(X38)
| ssList(app(X37,X38)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ neq(esk1_0,nil)
| ~ rearsegP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_20,plain,
! [X15,X16] :
( ( ~ neq(X15,X16)
| X15 != X16
| ~ ssList(X16)
| ~ ssList(X15) )
& ( X15 = X16
| neq(X15,X16)
| ~ ssList(X16)
| ~ ssList(X15) ) ),
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_10])])])])]) ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,negated_conjecture,
cons(esk5_0,nil) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_23,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_24,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_14]),c_0_15])]) ).
cnf(c_0_25,plain,
( rearsegP(X3,X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_28,negated_conjecture,
( ssList(esk6_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_29,negated_conjecture,
( ~ rearsegP(esk2_0,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_14]),c_0_15])]) ).
cnf(c_0_30,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_32,negated_conjecture,
esk1_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_33,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_25]),c_0_26]) ).
cnf(c_0_34,negated_conjecture,
app(esk6_0,esk1_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_22]),c_0_14]),c_0_14]),c_0_15])]) ).
cnf(c_0_35,negated_conjecture,
ssList(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_14]),c_0_15])]) ).
cnf(c_0_36,negated_conjecture,
~ rearsegP(esk2_0,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_23]),c_0_31])]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31]),c_0_35])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC106+1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 02:50:53 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.45 Running first-order model finding
% 0.20/0.45 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.20/0.46 # Version: 3.1.0
% 0.20/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.46 # Starting sh5l with 300s (1) cores
% 0.20/0.46 # new_bool_1 with pid 21924 completed with status 0
% 0.20/0.46 # Result found by new_bool_1
% 0.20/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.46 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.20/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.20/0.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 21926 completed with status 0
% 0.20/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.20/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.46 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.20/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.20/0.46 # Preprocessing time : 0.001 s
% 0.20/0.46 # Presaturation interreduction done
% 0.20/0.46
% 0.20/0.46 # Proof found!
% 0.20/0.46 # SZS status Theorem
% 0.20/0.46 # SZS output start CNFRefutation
% See solution above
% 0.20/0.46 # Parsed axioms : 96
% 0.20/0.46 # Removed by relevancy pruning/SinE : 70
% 0.20/0.46 # Initial clauses : 55
% 0.20/0.46 # Removed in clause preprocessing : 0
% 0.20/0.46 # Initial clauses in saturation : 55
% 0.20/0.46 # Processed clauses : 127
% 0.20/0.46 # ...of these trivial : 8
% 0.20/0.46 # ...subsumed : 5
% 0.20/0.46 # ...remaining for further processing : 114
% 0.20/0.46 # Other redundant clauses eliminated : 14
% 0.20/0.46 # Clauses deleted for lack of memory : 0
% 0.20/0.46 # Backward-subsumed : 1
% 0.20/0.46 # Backward-rewritten : 2
% 0.20/0.46 # Generated clauses : 135
% 0.20/0.46 # ...of the previous two non-redundant : 104
% 0.20/0.46 # ...aggressively subsumed : 0
% 0.20/0.46 # Contextual simplify-reflections : 4
% 0.20/0.46 # Paramodulations : 118
% 0.20/0.46 # Factorizations : 0
% 0.20/0.46 # NegExts : 0
% 0.20/0.46 # Equation resolutions : 18
% 0.20/0.46 # Disequality decompositions : 0
% 0.20/0.46 # Total rewrite steps : 134
% 0.20/0.46 # ...of those cached : 120
% 0.20/0.47 # Propositional unsat checks : 0
% 0.20/0.47 # Propositional check models : 0
% 0.20/0.47 # Propositional check unsatisfiable : 0
% 0.20/0.47 # Propositional clauses : 0
% 0.20/0.47 # Propositional clauses after purity: 0
% 0.20/0.47 # Propositional unsat core size : 0
% 0.20/0.47 # Propositional preprocessing time : 0.000
% 0.20/0.47 # Propositional encoding time : 0.000
% 0.20/0.47 # Propositional solver time : 0.000
% 0.20/0.47 # Success case prop preproc time : 0.000
% 0.20/0.47 # Success case prop encoding time : 0.000
% 0.20/0.47 # Success case prop solver time : 0.000
% 0.20/0.47 # Current number of processed clauses : 59
% 0.20/0.47 # Positive orientable unit clauses : 15
% 0.20/0.47 # Positive unorientable unit clauses: 0
% 0.20/0.47 # Negative unit clauses : 4
% 0.20/0.47 # Non-unit-clauses : 40
% 0.20/0.47 # Current number of unprocessed clauses: 73
% 0.20/0.47 # ...number of literals in the above : 298
% 0.20/0.47 # Current number of archived formulas : 0
% 0.20/0.47 # Current number of archived clauses : 50
% 0.20/0.47 # Clause-clause subsumption calls (NU) : 390
% 0.20/0.47 # Rec. Clause-clause subsumption calls : 142
% 0.20/0.47 # Non-unit clause-clause subsumptions : 6
% 0.20/0.47 # Unit Clause-clause subsumption calls : 8
% 0.20/0.47 # Rewrite failures with RHS unbound : 0
% 0.20/0.47 # BW rewrite match attempts : 1
% 0.20/0.47 # BW rewrite match successes : 1
% 0.20/0.47 # Condensation attempts : 0
% 0.20/0.47 # Condensation successes : 0
% 0.20/0.47 # Termbank termtop insertions : 6933
% 0.20/0.47 # Search garbage collected termcells : 1528
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.008 s
% 0.20/0.47 # System time : 0.001 s
% 0.20/0.47 # Total time : 0.009 s
% 0.20/0.47 # Maximum resident set size: 1908 pages
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.010 s
% 0.20/0.47 # System time : 0.003 s
% 0.20/0.47 # Total time : 0.013 s
% 0.20/0.47 # Maximum resident set size: 1820 pages
% 0.20/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------