TSTP Solution File: SWC095+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC095+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:18 EDT 2023
% Result : Theorem 0.34s 0.62s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 9 unt; 0 def)
% Number of atoms : 69 ( 28 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 84 ( 30 ~; 25 |; 19 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn; 17 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X1
& app(X5,X7) = X2 ) ) )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(app(X8,X9),X10) != X3
| app(X8,X10) != X4 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qLCkQkwIv3/E---3.1_27506.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] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X1
& app(X5,X7) = X2 ) ) )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(app(X8,X9),X10) != X3
| app(X8,X10) != X4 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_2,negated_conjecture,
! [X15,X16,X17] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ~ ssList(X15)
| ~ ssList(X16)
| ~ ssList(X17)
| app(app(X15,X16),X17) != esk1_0
| app(X15,X17) != esk2_0 )
& ssList(esk5_0)
& ssList(esk6_0)
& ssList(esk7_0)
& app(app(esk5_0,esk6_0),esk7_0) = esk3_0
& app(esk5_0,esk7_0) = esk4_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,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != esk1_0
| app(X1,X3) != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( app(app(X1,X2),X3) != esk1_0
| app(X1,X3) != esk4_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,negated_conjecture,
app(esk5_0,esk7_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
app(app(esk5_0,esk6_0),esk7_0) = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( app(app(esk5_0,X1),esk7_0) != esk1_0
| ~ ssList(X1) ),
inference(cn,[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])]) ).
cnf(c_0_12,negated_conjecture,
app(app(esk5_0,esk6_0),esk7_0) = esk1_0,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.23 % Problem : SWC095+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.24 % Command : run_E %s %d THM
% 0.14/0.45 % Computer : n007.cluster.edu
% 0.14/0.45 % Model : x86_64 x86_64
% 0.14/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.45 % Memory : 8042.1875MB
% 0.14/0.45 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.45 % CPULimit : 2400
% 0.14/0.45 % WCLimit : 300
% 0.14/0.45 % DateTime : Tue Oct 3 01:30:25 EDT 2023
% 0.14/0.45 % CPUTime :
% 0.34/0.60 Running first-order theorem proving
% 0.34/0.60 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/tmp/tmp.qLCkQkwIv3/E---3.1_27506.p
% 0.34/0.62 # Version: 3.1pre001
% 0.34/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.34/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.34/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.34/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.34/0.62 # Starting sh5l with 300s (1) cores
% 0.34/0.62 # new_bool_3 with pid 27613 completed with status 0
% 0.34/0.62 # Result found by new_bool_3
% 0.34/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.34/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.34/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.34/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/0.62 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.34/0.62 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.34/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.34/0.62 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 27616 completed with status 0
% 0.34/0.62 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.34/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.34/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.34/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.34/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/0.62 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.34/0.62 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.34/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.34/0.62 # Preprocessing time : 0.002 s
% 0.34/0.62 # Presaturation interreduction done
% 0.34/0.62
% 0.34/0.62 # Proof found!
% 0.34/0.62 # SZS status Theorem
% 0.34/0.62 # SZS output start CNFRefutation
% See solution above
% 0.34/0.62 # Parsed axioms : 96
% 0.34/0.62 # Removed by relevancy pruning/SinE : 79
% 0.34/0.62 # Initial clauses : 35
% 0.34/0.62 # Removed in clause preprocessing : 0
% 0.34/0.62 # Initial clauses in saturation : 35
% 0.34/0.62 # Processed clauses : 65
% 0.34/0.62 # ...of these trivial : 2
% 0.34/0.62 # ...subsumed : 0
% 0.34/0.62 # ...remaining for further processing : 63
% 0.34/0.62 # Other redundant clauses eliminated : 4
% 0.34/0.62 # Clauses deleted for lack of memory : 0
% 0.34/0.62 # Backward-subsumed : 0
% 0.34/0.62 # Backward-rewritten : 0
% 0.34/0.62 # Generated clauses : 22
% 0.34/0.62 # ...of the previous two non-redundant : 12
% 0.34/0.62 # ...aggressively subsumed : 0
% 0.34/0.62 # Contextual simplify-reflections : 0
% 0.34/0.62 # Paramodulations : 19
% 0.34/0.62 # Factorizations : 0
% 0.34/0.62 # NegExts : 0
% 0.34/0.62 # Equation resolutions : 4
% 0.34/0.62 # Total rewrite steps : 37
% 0.34/0.62 # Propositional unsat checks : 0
% 0.34/0.62 # Propositional check models : 0
% 0.34/0.62 # Propositional check unsatisfiable : 0
% 0.34/0.62 # Propositional clauses : 0
% 0.34/0.62 # Propositional clauses after purity: 0
% 0.34/0.62 # Propositional unsat core size : 0
% 0.34/0.62 # Propositional preprocessing time : 0.000
% 0.34/0.62 # Propositional encoding time : 0.000
% 0.34/0.62 # Propositional solver time : 0.000
% 0.34/0.62 # Success case prop preproc time : 0.000
% 0.34/0.62 # Success case prop encoding time : 0.000
% 0.34/0.62 # Success case prop solver time : 0.000
% 0.34/0.62 # Current number of processed clauses : 29
% 0.34/0.62 # Positive orientable unit clauses : 13
% 0.34/0.62 # Positive unorientable unit clauses: 0
% 0.34/0.62 # Negative unit clauses : 1
% 0.34/0.62 # Non-unit-clauses : 15
% 0.34/0.62 # Current number of unprocessed clauses: 13
% 0.34/0.62 # ...number of literals in the above : 50
% 0.34/0.62 # Current number of archived formulas : 0
% 0.34/0.62 # Current number of archived clauses : 33
% 0.34/0.62 # Clause-clause subsumption calls (NU) : 75
% 0.34/0.62 # Rec. Clause-clause subsumption calls : 37
% 0.34/0.62 # Non-unit clause-clause subsumptions : 0
% 0.34/0.62 # Unit Clause-clause subsumption calls : 0
% 0.34/0.62 # Rewrite failures with RHS unbound : 0
% 0.34/0.62 # BW rewrite match attempts : 0
% 0.34/0.62 # BW rewrite match successes : 0
% 0.34/0.62 # Condensation attempts : 0
% 0.34/0.62 # Condensation successes : 0
% 0.34/0.62 # Termbank termtop insertions : 3625
% 0.34/0.62
% 0.34/0.62 # -------------------------------------------------
% 0.34/0.62 # User time : 0.007 s
% 0.34/0.62 # System time : 0.002 s
% 0.34/0.62 # Total time : 0.009 s
% 0.34/0.62 # Maximum resident set size: 1884 pages
% 0.34/0.62
% 0.34/0.62 # -------------------------------------------------
% 0.34/0.62 # User time : 0.011 s
% 0.34/0.62 # System time : 0.003 s
% 0.34/0.62 # Total time : 0.014 s
% 0.34/0.62 # Maximum resident set size: 1796 pages
% 0.34/0.62 % E---3.1 exiting
% 0.34/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------