TSTP Solution File: SWC040+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC040+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:22:45 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 7 unt; 0 def)
% Number of atoms : 57 ( 32 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 68 ( 22 ~; 18 |; 16 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(cons(X5,nil),X6) != X3
| app(X6,cons(X5,nil)) != X4 ) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(cons(X5,nil),X6) != X3
| app(X6,cons(X5,nil)) != X4 ) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_2,negated_conjecture,
( 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
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssItem(esk5_0)
| ~ neq(esk4_0,nil) )
& ( ssList(esk6_0)
| ~ neq(esk4_0,nil) )
& ( app(cons(esk5_0,nil),esk6_0) = esk3_0
| ~ neq(esk4_0,nil) )
& ( app(esk6_0,cons(esk5_0,nil)) = esk4_0
| ~ neq(esk4_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_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
nil = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
esk4_0 = nil,
inference(rw,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_9,negated_conjecture,
esk3_0 != nil,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC040+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 02:53:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_1 with pid 14749 completed with status 0
% 0.20/0.49 # Result found by new_bool_1
% 0.20/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.20/0.49 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 14752 completed with status 0
% 0.20/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.20/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.20/0.49 # Preprocessing time : 0.002 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 96
% 0.20/0.49 # Removed by relevancy pruning/SinE : 77
% 0.20/0.49 # Initial clauses : 40
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 40
% 0.20/0.49 # Processed clauses : 13
% 0.20/0.49 # ...of these trivial : 2
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 10
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 1
% 0.20/0.49 # Generated clauses : 0
% 0.20/0.49 # ...of the previous two non-redundant : 1
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 0
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 7
% 0.20/0.49 # ...of those cached : 2
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 9
% 0.20/0.49 # Positive orientable unit clauses : 7
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 0
% 0.20/0.49 # Current number of unprocessed clauses: 28
% 0.20/0.49 # ...number of literals in the above : 96
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 1
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 1
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 1
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3643
% 0.20/0.49 # Search garbage collected termcells : 1359
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.007 s
% 0.20/0.49 # Maximum resident set size: 1896 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.009 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.013 s
% 0.20/0.49 # Maximum resident set size: 1824 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------