TSTP Solution File: SWC364+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC364+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:38 EDT 2023
% Result : Theorem 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 12 unt; 0 def)
% Number of atoms : 122 ( 21 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 148 ( 57 ~; 55 |; 20 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn; 22 !; 2 ?)
% 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)
=> app(cons(X5,nil),X3) != X4 )
| segmentP(X2,X1) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Q6KeCmyuza/E---3.1_29923.p',co1) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Q6KeCmyuza/E---3.1_29923.p',ax7) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.Q6KeCmyuza/E---3.1_29923.p',ax84) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.Q6KeCmyuza/E---3.1_29923.p',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Q6KeCmyuza/E---3.1_29923.p',ax16) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> app(cons(X5,nil),X3) != X4 )
| segmentP(X2,X1) )
& ( ~ neq(X2,nil)
| 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
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ssItem(esk5_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk5_0) )
& ( neq(esk2_0,nil)
| app(cons(esk5_0,nil),esk3_0) = esk4_0 )
& ( ~ neq(esk4_0,nil)
| app(cons(esk5_0,nil),esk3_0) = esk4_0 )
& ( neq(esk2_0,nil)
| ~ segmentP(esk2_0,esk1_0) )
& ( ~ neq(esk4_0,nil)
| ~ segmentP(esk2_0,esk1_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_7,plain,
! [X21,X22,X25,X26] :
( ( ssList(esk8_2(X21,X22))
| ~ segmentP(X21,X22)
| ~ ssList(X22)
| ~ ssList(X21) )
& ( ssList(esk9_2(X21,X22))
| ~ segmentP(X21,X22)
| ~ ssList(X22)
| ~ ssList(X21) )
& ( app(app(esk8_2(X21,X22),X22),esk9_2(X21,X22)) = X21
| ~ segmentP(X21,X22)
| ~ ssList(X22)
| ~ ssList(X21) )
& ( ~ ssList(X25)
| ~ ssList(X26)
| app(app(X25,X22),X26) != X21
| segmentP(X21,X22)
| ~ ssList(X22)
| ~ ssList(X21) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).
cnf(c_0_8,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( app(cons(esk5_0,nil),esk3_0) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
app(cons(esk5_0,nil),esk1_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_12]),c_0_13])]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_18,plain,
! [X58] :
( ~ ssList(X58)
| app(X58,nil) = X58 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_19,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk2_0,nil) ),
inference(rw,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( segmentP(app(esk2_0,X1),esk1_0)
| ~ ssList(cons(esk5_0,nil))
| ~ ssList(app(esk2_0,X1))
| ~ ssList(X1) ),
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,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_24,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_13])]) ).
fof(c_0_25,plain,
! [X59,X60] :
( ~ ssList(X59)
| ~ ssItem(X60)
| ssList(cons(X60,X59)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_26,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,negated_conjecture,
~ ssList(cons(esk5_0,nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_28,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_12]),c_0_13])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.10 % Problem : SWC364+1 : TPTP v8.1.2. Released v2.4.0.
% 0.04/0.11 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n009.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 2400
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Tue Oct 3 01:49:14 EDT 2023
% 0.11/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.Q6KeCmyuza/E---3.1_29923.p
% 0.15/0.44 # Version: 3.1pre001
% 0.15/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # new_bool_3 with pid 30002 completed with status 0
% 0.15/0.44 # Result found by new_bool_3
% 0.15/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30005 completed with status 0
% 0.15/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.44 # Preprocessing time : 0.001 s
% 0.15/0.44 # Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Theorem
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.44 # Parsed axioms : 96
% 0.15/0.44 # Removed by relevancy pruning/SinE : 70
% 0.15/0.44 # Initial clauses : 52
% 0.15/0.44 # Removed in clause preprocessing : 0
% 0.15/0.44 # Initial clauses in saturation : 52
% 0.15/0.44 # Processed clauses : 234
% 0.15/0.44 # ...of these trivial : 6
% 0.15/0.44 # ...subsumed : 42
% 0.15/0.44 # ...remaining for further processing : 186
% 0.15/0.44 # Other redundant clauses eliminated : 12
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 8
% 0.15/0.44 # Backward-rewritten : 10
% 0.15/0.44 # Generated clauses : 414
% 0.15/0.44 # ...of the previous two non-redundant : 366
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 14
% 0.15/0.44 # Paramodulations : 398
% 0.15/0.44 # Factorizations : 0
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 16
% 0.15/0.44 # Total rewrite steps : 262
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 116
% 0.15/0.44 # Positive orientable unit clauses : 20
% 0.15/0.44 # Positive unorientable unit clauses: 0
% 0.15/0.44 # Negative unit clauses : 8
% 0.15/0.44 # Non-unit-clauses : 88
% 0.15/0.44 # Current number of unprocessed clauses: 214
% 0.15/0.44 # ...number of literals in the above : 1095
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 65
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 1287
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 479
% 0.15/0.44 # Non-unit clause-clause subsumptions : 44
% 0.15/0.44 # Unit Clause-clause subsumption calls : 159
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 3
% 0.15/0.44 # BW rewrite match successes : 3
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 10787
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.017 s
% 0.15/0.44 # System time : 0.002 s
% 0.15/0.44 # Total time : 0.019 s
% 0.15/0.44 # Maximum resident set size: 1912 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.020 s
% 0.15/0.44 # System time : 0.003 s
% 0.15/0.44 # Total time : 0.023 s
% 0.15/0.44 # Maximum resident set size: 1792 pages
% 0.15/0.44 % E---3.1 exiting
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------