TSTP Solution File: SWC378+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC378+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:42 EDT 2023
% Result : Theorem 0.18s 0.52s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 127 ( 18 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 155 ( 60 ~; 65 |; 18 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn; 20 !; 0 ?)
% 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)
| app(X5,X6) != X4
| app(X6,X5) != X3 ) )
| ! [X7] :
( ~ ssItem(X7)
| ( ~ memberP(X2,X7)
& ~ memberP(X1,X7) )
| ( memberP(X2,X7)
& memberP(X1,X7) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.g2byYHhxXm/E---3.1_12800.p',co1) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.g2byYHhxXm/E---3.1_12800.p',ax36) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(X5,X6) != X4
| app(X6,X5) != X3 ) )
| ! [X7] :
( ~ ssItem(X7)
| ( ~ memberP(X2,X7)
& ~ memberP(X1,X7) )
| ( memberP(X2,X7)
& memberP(X1,X7) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_3,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& ssList(esk6_0)
& app(esk5_0,esk6_0) = esk4_0
& app(esk6_0,esk5_0) = esk3_0
& ssItem(esk7_0)
& ( memberP(esk2_0,esk7_0)
| memberP(esk1_0,esk7_0) )
& ( ~ memberP(esk2_0,esk7_0)
| ~ memberP(esk1_0,esk7_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,plain,
! [X21,X22,X23] :
( ( ~ memberP(app(X22,X23),X21)
| memberP(X22,X21)
| memberP(X23,X21)
| ~ ssList(X23)
| ~ ssList(X22)
| ~ ssItem(X21) )
& ( ~ memberP(X22,X21)
| memberP(app(X22,X23),X21)
| ~ ssList(X23)
| ~ ssList(X22)
| ~ ssItem(X21) )
& ( ~ memberP(X23,X21)
| memberP(app(X22,X23),X21)
| ~ ssList(X23)
| ~ ssList(X22)
| ~ ssItem(X21) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])]) ).
cnf(c_0_5,negated_conjecture,
app(esk5_0,esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
app(esk6_0,esk5_0) = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,plain,
( memberP(X1,X3)
| memberP(X2,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
app(esk5_0,esk6_0) = esk2_0,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_11,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
app(esk6_0,esk5_0) = esk1_0,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( memberP(esk5_0,X1)
| memberP(esk6_0,X1)
| ~ memberP(esk2_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_16,negated_conjecture,
( memberP(esk2_0,esk7_0)
| memberP(esk1_0,esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_17,negated_conjecture,
ssItem(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_18,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,negated_conjecture,
( memberP(esk1_0,X1)
| ~ memberP(esk6_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]),c_0_11])]) ).
cnf(c_0_20,negated_conjecture,
( memberP(esk1_0,esk7_0)
| memberP(esk6_0,esk7_0)
| memberP(esk5_0,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
( memberP(esk1_0,X1)
| ~ memberP(esk5_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_14]),c_0_11]),c_0_12])]) ).
cnf(c_0_22,negated_conjecture,
( memberP(esk5_0,esk7_0)
| memberP(esk1_0,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17])]) ).
cnf(c_0_23,negated_conjecture,
( memberP(esk6_0,X1)
| memberP(esk5_0,X1)
| ~ memberP(esk1_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_14]),c_0_12]),c_0_11])]) ).
cnf(c_0_24,negated_conjecture,
memberP(esk1_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17])]) ).
cnf(c_0_25,negated_conjecture,
( ~ memberP(esk2_0,esk7_0)
| ~ memberP(esk1_0,esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_26,negated_conjecture,
( memberP(esk2_0,X1)
| ~ memberP(esk6_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_10]),c_0_12]),c_0_11])]) ).
cnf(c_0_27,negated_conjecture,
( memberP(esk5_0,esk7_0)
| memberP(esk6_0,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_17])]) ).
cnf(c_0_28,negated_conjecture,
~ memberP(esk2_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
( memberP(esk2_0,X1)
| ~ memberP(esk5_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_30,negated_conjecture,
memberP(esk5_0,esk7_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_17])]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_17])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWC378+1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Oct 3 02:08:04 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.g2byYHhxXm/E---3.1_12800.p
% 0.18/0.52 # Version: 3.1pre001
% 0.18/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.52 # Starting sh5l with 300s (1) cores
% 0.18/0.52 # new_bool_3 with pid 12914 completed with status 0
% 0.18/0.52 # Result found by new_bool_3
% 0.18/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.52 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12918 completed with status 0
% 0.18/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.52 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.52 # Preprocessing time : 0.002 s
% 0.18/0.52 # Presaturation interreduction done
% 0.18/0.52
% 0.18/0.52 # Proof found!
% 0.18/0.52 # SZS status Theorem
% 0.18/0.52 # SZS output start CNFRefutation
% See solution above
% 0.18/0.52 # Parsed axioms : 96
% 0.18/0.52 # Removed by relevancy pruning/SinE : 75
% 0.18/0.52 # Initial clauses : 47
% 0.18/0.52 # Removed in clause preprocessing : 0
% 0.18/0.52 # Initial clauses in saturation : 47
% 0.18/0.52 # Processed clauses : 563
% 0.18/0.52 # ...of these trivial : 22
% 0.18/0.52 # ...subsumed : 234
% 0.18/0.52 # ...remaining for further processing : 307
% 0.18/0.52 # Other redundant clauses eliminated : 15
% 0.18/0.52 # Clauses deleted for lack of memory : 0
% 0.18/0.52 # Backward-subsumed : 31
% 0.18/0.52 # Backward-rewritten : 4
% 0.18/0.52 # Generated clauses : 1649
% 0.18/0.52 # ...of the previous two non-redundant : 1416
% 0.18/0.52 # ...aggressively subsumed : 0
% 0.18/0.52 # Contextual simplify-reflections : 15
% 0.18/0.52 # Paramodulations : 1630
% 0.18/0.52 # Factorizations : 0
% 0.18/0.52 # NegExts : 0
% 0.18/0.52 # Equation resolutions : 19
% 0.18/0.52 # Total rewrite steps : 1877
% 0.18/0.52 # Propositional unsat checks : 0
% 0.18/0.52 # Propositional check models : 0
% 0.18/0.52 # Propositional check unsatisfiable : 0
% 0.18/0.52 # Propositional clauses : 0
% 0.18/0.52 # Propositional clauses after purity: 0
% 0.18/0.52 # Propositional unsat core size : 0
% 0.18/0.52 # Propositional preprocessing time : 0.000
% 0.18/0.52 # Propositional encoding time : 0.000
% 0.18/0.52 # Propositional solver time : 0.000
% 0.18/0.52 # Success case prop preproc time : 0.000
% 0.18/0.52 # Success case prop encoding time : 0.000
% 0.18/0.52 # Success case prop solver time : 0.000
% 0.18/0.52 # Current number of processed clauses : 223
% 0.18/0.52 # Positive orientable unit clauses : 41
% 0.18/0.52 # Positive unorientable unit clauses: 0
% 0.18/0.52 # Negative unit clauses : 24
% 0.18/0.52 # Non-unit-clauses : 158
% 0.18/0.52 # Current number of unprocessed clauses: 850
% 0.18/0.52 # ...number of literals in the above : 3639
% 0.18/0.52 # Current number of archived formulas : 0
% 0.18/0.52 # Current number of archived clauses : 81
% 0.18/0.52 # Clause-clause subsumption calls (NU) : 4858
% 0.18/0.52 # Rec. Clause-clause subsumption calls : 2689
% 0.18/0.52 # Non-unit clause-clause subsumptions : 143
% 0.18/0.52 # Unit Clause-clause subsumption calls : 541
% 0.18/0.52 # Rewrite failures with RHS unbound : 0
% 0.18/0.52 # BW rewrite match attempts : 9
% 0.18/0.52 # BW rewrite match successes : 3
% 0.18/0.52 # Condensation attempts : 0
% 0.18/0.52 # Condensation successes : 0
% 0.18/0.52 # Termbank termtop insertions : 28746
% 0.18/0.52
% 0.18/0.52 # -------------------------------------------------
% 0.18/0.52 # User time : 0.042 s
% 0.18/0.52 # System time : 0.004 s
% 0.18/0.52 # Total time : 0.046 s
% 0.18/0.52 # Maximum resident set size: 1908 pages
% 0.18/0.52
% 0.18/0.52 # -------------------------------------------------
% 0.18/0.52 # User time : 0.044 s
% 0.18/0.52 # System time : 0.007 s
% 0.18/0.52 # Total time : 0.051 s
% 0.18/0.52 # Maximum resident set size: 1800 pages
% 0.18/0.52 % E---3.1 exiting
% 0.18/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------