TSTP Solution File: SWC275+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC275+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:40:12 EDT 2023
% Result : Theorem 0.21s 2.79s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 15 unt; 0 def)
% Number of atoms : 89 ( 28 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 100 ( 40 ~; 35 |; 15 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| totalorderedP(X1)
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X3
| ~ memberP(X4,X5) )
& neq(X4,nil) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ygFpipgpBK/E---3.1_8498.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ygFpipgpBK/E---3.1_8498.p',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.ygFpipgpBK/E---3.1_8498.p',ax17) ).
fof(ax66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/tmp/tmp.ygFpipgpBK/E---3.1_8498.p',ax66) ).
fof(ax65,axiom,
! [X1] :
( ssItem(X1)
=> totalorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox/tmp/tmp.ygFpipgpBK/E---3.1_8498.p',ax65) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| totalorderedP(X1)
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X3
| ~ memberP(X4,X5) )
& neq(X4,nil) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_6,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ~ totalorderedP(esk1_0)
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssItem(esk5_0)
| ~ neq(esk4_0,nil) )
& ( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) )
& ( memberP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_7,negated_conjecture,
~ totalorderedP(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X14,X15] :
( ( ~ neq(X14,X15)
| X14 != X15
| ~ ssList(X15)
| ~ ssList(X14) )
& ( X14 = X15
| neq(X14,X15)
| ~ ssList(X15)
| ~ ssList(X14) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_10,negated_conjecture,
~ totalorderedP(esk3_0),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( esk4_0 != nil
| ~ totalorderedP(nil) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
totalorderedP(nil),
inference(split_conjunct,[status(thm)],[ax66]) ).
cnf(c_0_18,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
esk4_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
fof(c_0_21,plain,
! [X60] :
( ~ ssItem(X60)
| totalorderedP(cons(X60,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])]) ).
cnf(c_0_22,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
neq(esk4_0,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_27,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/2.38 % Problem : SWC275+1 : TPTP v8.1.2. Released v2.4.0.
% 0.14/2.40 % Command : run_E %s %d THM
% 0.14/2.61 % Computer : n027.cluster.edu
% 0.14/2.61 % Model : x86_64 x86_64
% 0.14/2.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/2.61 % Memory : 8042.1875MB
% 0.14/2.61 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/2.61 % CPULimit : 2400
% 0.14/2.61 % WCLimit : 300
% 0.14/2.61 % DateTime : Tue Oct 3 02:09:24 EDT 2023
% 0.14/2.61 % CPUTime :
% 0.21/2.75 Running first-order theorem proving
% 0.21/2.75 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.ygFpipgpBK/E---3.1_8498.p
% 0.21/2.79 # Version: 3.1pre001
% 0.21/2.79 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/2.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/2.79 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/2.79 # Starting new_bool_3 with 300s (1) cores
% 0.21/2.79 # Starting new_bool_1 with 300s (1) cores
% 0.21/2.79 # Starting sh5l with 300s (1) cores
% 0.21/2.79 # new_bool_3 with pid 8577 completed with status 0
% 0.21/2.79 # Result found by new_bool_3
% 0.21/2.79 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/2.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/2.79 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/2.79 # Starting new_bool_3 with 300s (1) cores
% 0.21/2.79 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/2.79 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.21/2.79 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/2.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/2.79 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8580 completed with status 0
% 0.21/2.79 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/2.79 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/2.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/2.79 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/2.79 # Starting new_bool_3 with 300s (1) cores
% 0.21/2.79 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/2.79 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.21/2.79 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/2.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/2.79 # Preprocessing time : 0.003 s
% 0.21/2.79 # Presaturation interreduction done
% 0.21/2.79
% 0.21/2.79 # Proof found!
% 0.21/2.79 # SZS status Theorem
% 0.21/2.79 # SZS output start CNFRefutation
% See solution above
% 0.21/2.79 # Parsed axioms : 96
% 0.21/2.79 # Removed by relevancy pruning/SinE : 50
% 0.21/2.79 # Initial clauses : 87
% 0.21/2.79 # Removed in clause preprocessing : 1
% 0.21/2.79 # Initial clauses in saturation : 86
% 0.21/2.79 # Processed clauses : 254
% 0.21/2.79 # ...of these trivial : 2
% 0.21/2.79 # ...subsumed : 16
% 0.21/2.79 # ...remaining for further processing : 236
% 0.21/2.79 # Other redundant clauses eliminated : 15
% 0.21/2.79 # Clauses deleted for lack of memory : 0
% 0.21/2.79 # Backward-subsumed : 1
% 0.21/2.79 # Backward-rewritten : 12
% 0.21/2.79 # Generated clauses : 620
% 0.21/2.79 # ...of the previous two non-redundant : 578
% 0.21/2.79 # ...aggressively subsumed : 0
% 0.21/2.79 # Contextual simplify-reflections : 2
% 0.21/2.79 # Paramodulations : 602
% 0.21/2.79 # Factorizations : 0
% 0.21/2.79 # NegExts : 0
% 0.21/2.79 # Equation resolutions : 19
% 0.21/2.79 # Total rewrite steps : 216
% 0.21/2.79 # Propositional unsat checks : 0
% 0.21/2.79 # Propositional check models : 0
% 0.21/2.79 # Propositional check unsatisfiable : 0
% 0.21/2.79 # Propositional clauses : 0
% 0.21/2.79 # Propositional clauses after purity: 0
% 0.21/2.79 # Propositional unsat core size : 0
% 0.21/2.79 # Propositional preprocessing time : 0.000
% 0.21/2.79 # Propositional encoding time : 0.000
% 0.21/2.79 # Propositional solver time : 0.000
% 0.21/2.79 # Success case prop preproc time : 0.000
% 0.21/2.79 # Success case prop encoding time : 0.000
% 0.21/2.79 # Success case prop solver time : 0.000
% 0.21/2.79 # Current number of processed clauses : 134
% 0.21/2.79 # Positive orientable unit clauses : 30
% 0.21/2.79 # Positive unorientable unit clauses: 0
% 0.21/2.79 # Negative unit clauses : 4
% 0.21/2.79 # Non-unit-clauses : 100
% 0.21/2.79 # Current number of unprocessed clauses: 473
% 0.21/2.79 # ...number of literals in the above : 1806
% 0.21/2.79 # Current number of archived formulas : 0
% 0.21/2.79 # Current number of archived clauses : 94
% 0.21/2.79 # Clause-clause subsumption calls (NU) : 2778
% 0.21/2.79 # Rec. Clause-clause subsumption calls : 637
% 0.21/2.79 # Non-unit clause-clause subsumptions : 13
% 0.21/2.79 # Unit Clause-clause subsumption calls : 294
% 0.21/2.79 # Rewrite failures with RHS unbound : 0
% 0.21/2.79 # BW rewrite match attempts : 4
% 0.21/2.79 # BW rewrite match successes : 4
% 0.21/2.79 # Condensation attempts : 0
% 0.21/2.79 # Condensation successes : 0
% 0.21/2.79 # Termbank termtop insertions : 15795
% 0.21/2.79
% 0.21/2.79 # -------------------------------------------------
% 0.21/2.79 # User time : 0.028 s
% 0.21/2.79 # System time : 0.004 s
% 0.21/2.79 # Total time : 0.032 s
% 0.21/2.79 # Maximum resident set size: 2064 pages
% 0.21/2.79
% 0.21/2.79 # -------------------------------------------------
% 0.21/2.79 # User time : 0.032 s
% 0.21/2.79 # System time : 0.005 s
% 0.21/2.79 # Total time : 0.037 s
% 0.21/2.79 # Maximum resident set size: 1796 pages
% 0.21/2.79 % E---3.1 exiting
% 0.21/2.80 % E---3.1 exiting
%------------------------------------------------------------------------------