TSTP Solution File: SWC189+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC189+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:39:47 EDT 2023
% Result : Theorem 0.23s 0.54s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 8 unt; 0 def)
% Number of atoms : 74 ( 25 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 87 ( 26 ~; 23 |; 22 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn; 20 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X5 != X6
& app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) = X3 ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ! [X12] :
( ssList(X12)
=> ( app(app(app(X11,cons(X9,nil)),cons(X10,nil)),X12) != X1
| X9 = X10 ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6Yo68bEpcI/E---3.1_31534.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X5 != X6
& app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) = X3 ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ! [X12] :
( ssList(X12)
=> ( app(app(app(X11,cons(X9,nil)),cons(X10,nil)),X12) != X1
| X9 = X10 ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_2,negated_conjecture,
! [X17,X18,X19,X20] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ~ ssItem(X17)
| ~ ssItem(X18)
| ~ ssList(X19)
| ~ ssList(X20)
| X17 = X18
| app(app(app(X19,cons(X17,nil)),cons(X18,nil)),X20) != esk3_0 )
& ssItem(esk5_0)
& ssItem(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& app(app(app(esk7_0,cons(esk5_0,nil)),cons(esk6_0,nil)),esk8_0) = esk1_0
& esk5_0 != esk6_0 ),
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,
( X1 = X2
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(app(X3,cons(X1,nil)),cons(X2,nil)),X4) != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( X1 = X2
| app(app(app(X3,cons(X1,nil)),cons(X2,nil)),X4) != esk1_0
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,negated_conjecture,
app(app(app(esk7_0,cons(esk5_0,nil)),cons(esk6_0,nil)),esk8_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
esk5_0 != esk6_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8]),c_0_9]),c_0_10])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : SWC189+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n022.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Oct 3 01:56:09 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.52 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/tmp/tmp.6Yo68bEpcI/E---3.1_31534.p
% 0.23/0.54 # Version: 3.1pre001
% 0.23/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # new_bool_1 with pid 31666 completed with status 0
% 0.23/0.54 # Result found by new_bool_1
% 0.23/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.23/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.23/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31672 completed with status 0
% 0.23/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.23/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.23/0.54 # Preprocessing time : 0.002 s
% 0.23/0.54 # Presaturation interreduction done
% 0.23/0.54
% 0.23/0.54 # Proof found!
% 0.23/0.54 # SZS status Theorem
% 0.23/0.54 # SZS output start CNFRefutation
% See solution above
% 0.23/0.54 # Parsed axioms : 96
% 0.23/0.54 # Removed by relevancy pruning/SinE : 79
% 0.23/0.54 # Initial clauses : 36
% 0.23/0.54 # Removed in clause preprocessing : 0
% 0.23/0.54 # Initial clauses in saturation : 36
% 0.23/0.54 # Processed clauses : 83
% 0.23/0.54 # ...of these trivial : 2
% 0.23/0.54 # ...subsumed : 0
% 0.23/0.54 # ...remaining for further processing : 81
% 0.23/0.54 # Other redundant clauses eliminated : 6
% 0.23/0.54 # Clauses deleted for lack of memory : 0
% 0.23/0.54 # Backward-subsumed : 4
% 0.23/0.54 # Backward-rewritten : 0
% 0.23/0.54 # Generated clauses : 98
% 0.23/0.54 # ...of the previous two non-redundant : 80
% 0.23/0.54 # ...aggressively subsumed : 0
% 0.23/0.54 # Contextual simplify-reflections : 0
% 0.23/0.54 # Paramodulations : 89
% 0.23/0.54 # Factorizations : 0
% 0.23/0.54 # NegExts : 0
% 0.23/0.54 # Equation resolutions : 10
% 0.23/0.54 # Total rewrite steps : 56
% 0.23/0.54 # Propositional unsat checks : 0
% 0.23/0.54 # Propositional check models : 0
% 0.23/0.54 # Propositional check unsatisfiable : 0
% 0.23/0.54 # Propositional clauses : 0
% 0.23/0.54 # Propositional clauses after purity: 0
% 0.23/0.54 # Propositional unsat core size : 0
% 0.23/0.54 # Propositional preprocessing time : 0.000
% 0.23/0.54 # Propositional encoding time : 0.000
% 0.23/0.54 # Propositional solver time : 0.000
% 0.23/0.54 # Success case prop preproc time : 0.000
% 0.23/0.54 # Success case prop encoding time : 0.000
% 0.23/0.54 # Success case prop solver time : 0.000
% 0.23/0.54 # Current number of processed clauses : 42
% 0.23/0.54 # Positive orientable unit clauses : 13
% 0.23/0.54 # Positive unorientable unit clauses: 0
% 0.23/0.54 # Negative unit clauses : 2
% 0.23/0.54 # Non-unit-clauses : 27
% 0.23/0.54 # Current number of unprocessed clauses: 64
% 0.23/0.54 # ...number of literals in the above : 255
% 0.23/0.54 # Current number of archived formulas : 0
% 0.23/0.54 # Current number of archived clauses : 38
% 0.23/0.54 # Clause-clause subsumption calls (NU) : 139
% 0.23/0.54 # Rec. Clause-clause subsumption calls : 52
% 0.23/0.54 # Non-unit clause-clause subsumptions : 4
% 0.23/0.54 # Unit Clause-clause subsumption calls : 0
% 0.23/0.54 # Rewrite failures with RHS unbound : 0
% 0.23/0.54 # BW rewrite match attempts : 0
% 0.23/0.54 # BW rewrite match successes : 0
% 0.23/0.54 # Condensation attempts : 0
% 0.23/0.54 # Condensation successes : 0
% 0.23/0.54 # Termbank termtop insertions : 4960
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.011 s
% 0.23/0.54 # System time : 0.000 s
% 0.23/0.54 # Total time : 0.011 s
% 0.23/0.54 # Maximum resident set size: 1904 pages
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.014 s
% 0.23/0.54 # System time : 0.003 s
% 0.23/0.54 # Total time : 0.017 s
% 0.23/0.54 # Maximum resident set size: 1804 pages
% 0.23/0.54 % E---3.1 exiting
% 0.23/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------