TSTP Solution File: SWC317+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC317+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:25:36 EDT 2024
% Result : Theorem 0.23s 0.53s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 8 unt; 0 def)
% Number of atoms : 97 ( 32 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 119 ( 40 ~; 42 |; 25 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 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 : 22 ( 0 sgn 14 !; 4 ?)
% 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)
& app(cons(X5,nil),X6) = X1
& app(X6,cons(X5,nil)) = X2 ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(cons(X7,nil),X8) != X3
| app(X8,cons(X7,nil)) != X4 ) ) ) )
& ( ~ neq(X2,nil)
| 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)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X1
& app(X6,cons(X5,nil)) = X2 ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(cons(X7,nil),X8) != X3
| app(X8,cons(X7,nil)) != X4 ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_2,negated_conjecture,
! [X13,X14] :
( 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(X13)
| ~ ssList(X14)
| app(cons(X13,nil),X14) != esk1_0
| app(X14,cons(X13,nil)) != esk2_0 )
& ( ~ neq(esk4_0,nil)
| ~ ssItem(X13)
| ~ ssList(X14)
| app(cons(X13,nil),X14) != esk1_0
| app(X14,cons(X13,nil)) != esk2_0 )
& ( 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)
| app(cons(esk5_0,nil),esk6_0) = esk3_0 )
& ( ~ neq(esk4_0,nil)
| app(cons(esk5_0,nil),esk6_0) = 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 ) ),
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_1])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk1_0
| app(X2,cons(X1,nil)) != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( ssList(esk6_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( app(X1,cons(X2,nil)) != esk2_0
| app(cons(X2,nil),X1) != esk1_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_6])]) ).
cnf(c_0_13,negated_conjecture,
app(esk6_0,cons(esk5_0,nil)) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_5]),c_0_5]),c_0_6])]) ).
cnf(c_0_14,negated_conjecture,
app(cons(esk5_0,nil),esk6_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_5]),c_0_6])]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_5]),c_0_6])]) ).
cnf(c_0_16,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_5]),c_0_6])]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWC317+1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n004.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sun May 19 02:47:37 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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.23/0.53 # Version: 3.1.0
% 0.23/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # new_bool_3 with pid 32472 completed with status 0
% 0.23/0.53 # Result found by new_bool_3
% 0.23/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.23/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.23/0.53 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 32475 completed with status 0
% 0.23/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.23/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.23/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.23/0.53 # Preprocessing time : 0.002 s
% 0.23/0.53 # Presaturation interreduction done
% 0.23/0.53
% 0.23/0.53 # Proof found!
% 0.23/0.53 # SZS status Theorem
% 0.23/0.53 # SZS output start CNFRefutation
% See solution above
% 0.23/0.53 # Parsed axioms : 96
% 0.23/0.53 # Removed by relevancy pruning/SinE : 77
% 0.23/0.53 # Initial clauses : 45
% 0.23/0.53 # Removed in clause preprocessing : 0
% 0.23/0.53 # Initial clauses in saturation : 45
% 0.23/0.53 # Processed clauses : 81
% 0.23/0.53 # ...of these trivial : 8
% 0.23/0.53 # ...subsumed : 0
% 0.23/0.53 # ...remaining for further processing : 73
% 0.23/0.53 # Other redundant clauses eliminated : 4
% 0.23/0.53 # Clauses deleted for lack of memory : 0
% 0.23/0.53 # Backward-subsumed : 0
% 0.23/0.53 # Backward-rewritten : 0
% 0.23/0.53 # Generated clauses : 16
% 0.23/0.53 # ...of the previous two non-redundant : 7
% 0.23/0.53 # ...aggressively subsumed : 0
% 0.23/0.53 # Contextual simplify-reflections : 0
% 0.23/0.53 # Paramodulations : 13
% 0.23/0.53 # Factorizations : 0
% 0.23/0.53 # NegExts : 0
% 0.23/0.53 # Equation resolutions : 4
% 0.23/0.53 # Disequality decompositions : 0
% 0.23/0.53 # Total rewrite steps : 48
% 0.23/0.53 # ...of those cached : 38
% 0.23/0.53 # Propositional unsat checks : 0
% 0.23/0.53 # Propositional check models : 0
% 0.23/0.53 # Propositional check unsatisfiable : 0
% 0.23/0.53 # Propositional clauses : 0
% 0.23/0.53 # Propositional clauses after purity: 0
% 0.23/0.53 # Propositional unsat core size : 0
% 0.23/0.53 # Propositional preprocessing time : 0.000
% 0.23/0.53 # Propositional encoding time : 0.000
% 0.23/0.53 # Propositional solver time : 0.000
% 0.23/0.53 # Success case prop preproc time : 0.000
% 0.23/0.53 # Success case prop encoding time : 0.000
% 0.23/0.53 # Success case prop solver time : 0.000
% 0.23/0.53 # Current number of processed clauses : 33
% 0.23/0.53 # Positive orientable unit clauses : 13
% 0.23/0.53 # Positive unorientable unit clauses: 0
% 0.23/0.53 # Negative unit clauses : 1
% 0.23/0.53 # Non-unit-clauses : 19
% 0.23/0.53 # Current number of unprocessed clauses: 8
% 0.23/0.53 # ...number of literals in the above : 36
% 0.23/0.53 # Current number of archived formulas : 0
% 0.23/0.53 # Current number of archived clauses : 37
% 0.23/0.53 # Clause-clause subsumption calls (NU) : 99
% 0.23/0.53 # Rec. Clause-clause subsumption calls : 42
% 0.23/0.53 # Non-unit clause-clause subsumptions : 0
% 0.23/0.53 # Unit Clause-clause subsumption calls : 0
% 0.23/0.53 # Rewrite failures with RHS unbound : 0
% 0.23/0.53 # BW rewrite match attempts : 0
% 0.23/0.53 # BW rewrite match successes : 0
% 0.23/0.53 # Condensation attempts : 0
% 0.23/0.53 # Condensation successes : 0
% 0.23/0.53 # Termbank termtop insertions : 4541
% 0.23/0.53 # Search garbage collected termcells : 1394
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.009 s
% 0.23/0.53 # System time : 0.000 s
% 0.23/0.53 # Total time : 0.009 s
% 0.23/0.53 # Maximum resident set size: 1896 pages
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.013 s
% 0.23/0.53 # System time : 0.002 s
% 0.23/0.53 # Total time : 0.015 s
% 0.23/0.53 # Maximum resident set size: 1820 pages
% 0.23/0.53 % E---3.1 exiting
% 0.23/0.54 % E exiting
%------------------------------------------------------------------------------