TSTP Solution File: SWC210+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC210+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:24:26 EDT 2024
% Result : Theorem 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 14 unt; 0 def)
% Number of atoms : 80 ( 14 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 90 ( 34 ~; 28 |; 14 &)
% ( 2 <=>; 12 =>; 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 : 16 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ~ singletonP(X3)
| neq(X1,nil) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
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(ax39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax39) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/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
| ( ( ~ neq(X2,nil)
| ~ singletonP(X3)
| neq(X1,nil) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
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
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| singletonP(esk3_0) )
& ( ~ neq(esk4_0,nil)
| singletonP(esk3_0) )
& ( neq(esk2_0,nil)
| ~ neq(esk1_0,nil) )
& ( ~ neq(esk4_0,nil)
| ~ neq(esk1_0,nil) ) ),
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,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_8,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ neq(esk1_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X13,X14] :
( ( ~ neq(X13,X14)
| X13 != X14
| ~ ssList(X14)
| ~ ssList(X13) )
& ( X13 = X14
| neq(X13,X14)
| ~ ssList(X14)
| ~ ssList(X13) ) ),
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_7])])])])]) ).
fof(c_0_12,plain,
~ singletonP(nil),
inference(fof_simplification,[status(thm)],[ax39]) ).
cnf(c_0_13,negated_conjecture,
( singletonP(esk3_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
~ neq(esk1_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_16,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_19,plain,
~ singletonP(nil),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
singletonP(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_9]),c_0_10])]) ).
cnf(c_0_21,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_22,plain,
~ singletonP(nil),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SWC210+1 : TPTP v8.2.0. Released v2.4.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Sun May 19 03:20:22 EDT 2024
% 0.10/0.29 % CPUTime :
% 0.13/0.38 Running first-order theorem proving
% 0.13/0.38 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.13/0.40 # Version: 3.1.0
% 0.13/0.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.40 # Starting sh5l with 300s (1) cores
% 0.13/0.40 # new_bool_1 with pid 28646 completed with status 0
% 0.13/0.40 # Result found by new_bool_1
% 0.13/0.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.40 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.13/0.40 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.40 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.13/0.40 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 28648 completed with status 0
% 0.13/0.40 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.13/0.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.40 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.13/0.40 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.40 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.13/0.40 # Preprocessing time : 0.001 s
% 0.13/0.40 # Presaturation interreduction done
% 0.13/0.40
% 0.13/0.40 # Proof found!
% 0.13/0.40 # SZS status Theorem
% 0.13/0.40 # SZS output start CNFRefutation
% See solution above
% 0.13/0.40 # Parsed axioms : 96
% 0.13/0.40 # Removed by relevancy pruning/SinE : 75
% 0.13/0.40 # Initial clauses : 43
% 0.13/0.40 # Removed in clause preprocessing : 0
% 0.13/0.40 # Initial clauses in saturation : 43
% 0.13/0.40 # Processed clauses : 78
% 0.13/0.40 # ...of these trivial : 5
% 0.13/0.40 # ...subsumed : 0
% 0.13/0.40 # ...remaining for further processing : 73
% 0.13/0.40 # Other redundant clauses eliminated : 5
% 0.13/0.40 # Clauses deleted for lack of memory : 0
% 0.13/0.40 # Backward-subsumed : 0
% 0.13/0.40 # Backward-rewritten : 5
% 0.13/0.40 # Generated clauses : 12
% 0.13/0.40 # ...of the previous two non-redundant : 8
% 0.13/0.40 # ...aggressively subsumed : 0
% 0.13/0.40 # Contextual simplify-reflections : 0
% 0.13/0.40 # Paramodulations : 8
% 0.13/0.40 # Factorizations : 0
% 0.13/0.40 # NegExts : 0
% 0.13/0.40 # Equation resolutions : 5
% 0.13/0.40 # Disequality decompositions : 0
% 0.13/0.40 # Total rewrite steps : 30
% 0.13/0.40 # ...of those cached : 22
% 0.13/0.40 # Propositional unsat checks : 0
% 0.13/0.40 # Propositional check models : 0
% 0.13/0.40 # Propositional check unsatisfiable : 0
% 0.13/0.40 # Propositional clauses : 0
% 0.13/0.40 # Propositional clauses after purity: 0
% 0.13/0.40 # Propositional unsat core size : 0
% 0.13/0.40 # Propositional preprocessing time : 0.000
% 0.13/0.40 # Propositional encoding time : 0.000
% 0.13/0.40 # Propositional solver time : 0.000
% 0.13/0.40 # Success case prop preproc time : 0.000
% 0.13/0.40 # Success case prop encoding time : 0.000
% 0.13/0.40 # Success case prop solver time : 0.000
% 0.13/0.40 # Current number of processed clauses : 26
% 0.13/0.40 # Positive orientable unit clauses : 8
% 0.13/0.40 # Positive unorientable unit clauses: 0
% 0.13/0.40 # Negative unit clauses : 2
% 0.13/0.40 # Non-unit-clauses : 16
% 0.13/0.40 # Current number of unprocessed clauses: 10
% 0.13/0.40 # ...number of literals in the above : 41
% 0.13/0.40 # Current number of archived formulas : 0
% 0.13/0.40 # Current number of archived clauses : 43
% 0.13/0.40 # Clause-clause subsumption calls (NU) : 84
% 0.13/0.40 # Rec. Clause-clause subsumption calls : 39
% 0.13/0.40 # Non-unit clause-clause subsumptions : 0
% 0.13/0.40 # Unit Clause-clause subsumption calls : 2
% 0.13/0.40 # Rewrite failures with RHS unbound : 0
% 0.13/0.40 # BW rewrite match attempts : 1
% 0.13/0.40 # BW rewrite match successes : 1
% 0.13/0.40 # Condensation attempts : 0
% 0.13/0.40 # Condensation successes : 0
% 0.13/0.40 # Termbank termtop insertions : 4306
% 0.13/0.40 # Search garbage collected termcells : 1327
% 0.13/0.40
% 0.13/0.40 # -------------------------------------------------
% 0.13/0.40 # User time : 0.005 s
% 0.13/0.40 # System time : 0.002 s
% 0.13/0.40 # Total time : 0.007 s
% 0.13/0.40 # Maximum resident set size: 1884 pages
% 0.13/0.40
% 0.13/0.40 # -------------------------------------------------
% 0.13/0.40 # User time : 0.007 s
% 0.13/0.40 # System time : 0.003 s
% 0.13/0.40 # Total time : 0.010 s
% 0.13/0.40 # Maximum resident set size: 1824 pages
% 0.13/0.40 % E---3.1 exiting
% 0.13/0.40 % E exiting
%------------------------------------------------------------------------------