TSTP Solution File: SWC080+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC080+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:13 EDT 2023
% Result : Theorem 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 12 unt; 0 def)
% Number of atoms : 192 ( 19 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 256 ( 104 ~; 104 |; 33 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 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 : 55 ( 0 sgn; 28 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ frontsegP(X4,X6)
| ~ frontsegP(X3,X6) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Jafv6hzYWi/E---3.1_19443.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.Jafv6hzYWi/E---3.1_19443.p',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.Jafv6hzYWi/E---3.1_19443.p',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Jafv6hzYWi/E---3.1_19443.p',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.Jafv6hzYWi/E---3.1_19443.p',ax17) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Jafv6hzYWi/E---3.1_19443.p',ax5) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ frontsegP(X4,X6)
| ~ frontsegP(X3,X6) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_7,plain,
! [X41,X42,X45,X46] :
( ( ssList(esk9_2(X41,X42))
| ~ segmentP(X41,X42)
| ~ ssList(X42)
| ~ ssList(X41) )
& ( ssList(esk10_2(X41,X42))
| ~ segmentP(X41,X42)
| ~ ssList(X42)
| ~ ssList(X41) )
& ( app(app(esk9_2(X41,X42),X42),esk10_2(X41,X42)) = X41
| ~ segmentP(X41,X42)
| ~ ssList(X42)
| ~ ssList(X41) )
& ( ~ ssList(X45)
| ~ ssList(X46)
| app(app(X45,X42),X46) != X41
| segmentP(X41,X42)
| ~ ssList(X42)
| ~ ssList(X41) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).
fof(c_0_8,negated_conjecture,
! [X11] :
( 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)
| ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11) )
& ( neq(esk2_0,nil)
| ssList(esk5_0) )
& ( ~ neq(esk4_0,nil)
| ssList(esk5_0) )
& ( neq(esk2_0,nil)
| neq(esk5_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk5_0,nil) )
& ( neq(esk2_0,nil)
| frontsegP(esk4_0,esk5_0) )
& ( ~ neq(esk4_0,nil)
| frontsegP(esk4_0,esk5_0) )
& ( neq(esk2_0,nil)
| frontsegP(esk3_0,esk5_0) )
& ( ~ neq(esk4_0,nil)
| frontsegP(esk3_0,esk5_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[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]) ).
fof(c_0_10,plain,
! [X76] :
( ~ ssList(X76)
| app(nil,X76) = X76 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_11,plain,
! [X74,X75] :
( ~ ssList(X74)
| ~ ssList(X75)
| ssList(app(X74,X75)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_12,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,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_14,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_16,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X22,X23,X25] :
( ( ssList(esk8_2(X22,X23))
| ~ frontsegP(X22,X23)
| ~ ssList(X23)
| ~ ssList(X22) )
& ( app(X23,esk8_2(X22,X23)) = X22
| ~ frontsegP(X22,X23)
| ~ ssList(X23)
| ~ ssList(X22) )
& ( ~ ssList(X25)
| app(X23,X25) != X22
| frontsegP(X22,X23)
| ~ ssList(X23)
| ~ ssList(X22) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_22,plain,
( app(X1,esk8_2(X2,X1)) = X2
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( ssList(esk8_2(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_25,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
( ~ segmentP(esk2_0,X1)
| ~ frontsegP(esk1_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
( neq(esk5_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_30,negated_conjecture,
( frontsegP(esk3_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_31,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_32,negated_conjecture,
( frontsegP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,negated_conjecture,
( ssList(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_34,negated_conjecture,
( ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_28])]) ).
cnf(c_0_35,negated_conjecture,
neq(esk5_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_19]),c_0_20])]) ).
cnf(c_0_36,negated_conjecture,
frontsegP(esk1_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_19]),c_0_20])]) ).
cnf(c_0_37,negated_conjecture,
frontsegP(esk2_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_19]),c_0_19]),c_0_20])]) ).
cnf(c_0_38,negated_conjecture,
ssList(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_19]),c_0_20])]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC080+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 01:54:53 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.Jafv6hzYWi/E---3.1_19443.p
% 0.18/0.50 # Version: 3.1pre001
% 0.18/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 # Starting sh5l with 300s (1) cores
% 0.18/0.50 # new_bool_1 with pid 19523 completed with status 0
% 0.18/0.50 # Result found by new_bool_1
% 0.18/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.50 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19525 completed with status 0
% 0.18/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.50 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.50 # Preprocessing time : 0.002 s
% 0.18/0.50 # Presaturation interreduction done
% 0.18/0.50
% 0.18/0.50 # Proof found!
% 0.18/0.50 # SZS status Theorem
% 0.18/0.50 # SZS output start CNFRefutation
% See solution above
% 0.18/0.50 # Parsed axioms : 96
% 0.18/0.50 # Removed by relevancy pruning/SinE : 62
% 0.18/0.50 # Initial clauses : 69
% 0.18/0.50 # Removed in clause preprocessing : 0
% 0.18/0.50 # Initial clauses in saturation : 69
% 0.18/0.50 # Processed clauses : 346
% 0.18/0.50 # ...of these trivial : 8
% 0.18/0.50 # ...subsumed : 46
% 0.18/0.50 # ...remaining for further processing : 292
% 0.18/0.50 # Other redundant clauses eliminated : 25
% 0.18/0.50 # Clauses deleted for lack of memory : 0
% 0.18/0.50 # Backward-subsumed : 7
% 0.18/0.50 # Backward-rewritten : 1
% 0.18/0.50 # Generated clauses : 1122
% 0.18/0.50 # ...of the previous two non-redundant : 1036
% 0.18/0.50 # ...aggressively subsumed : 0
% 0.18/0.50 # Contextual simplify-reflections : 45
% 0.18/0.50 # Paramodulations : 1094
% 0.18/0.50 # Factorizations : 0
% 0.18/0.50 # NegExts : 0
% 0.18/0.50 # Equation resolutions : 29
% 0.18/0.50 # Total rewrite steps : 215
% 0.18/0.50 # Propositional unsat checks : 0
% 0.18/0.50 # Propositional check models : 0
% 0.18/0.50 # Propositional check unsatisfiable : 0
% 0.18/0.50 # Propositional clauses : 0
% 0.18/0.50 # Propositional clauses after purity: 0
% 0.18/0.50 # Propositional unsat core size : 0
% 0.18/0.50 # Propositional preprocessing time : 0.000
% 0.18/0.50 # Propositional encoding time : 0.000
% 0.18/0.50 # Propositional solver time : 0.000
% 0.18/0.50 # Success case prop preproc time : 0.000
% 0.18/0.50 # Success case prop encoding time : 0.000
% 0.18/0.50 # Success case prop solver time : 0.000
% 0.18/0.50 # Current number of processed clauses : 215
% 0.18/0.50 # Positive orientable unit clauses : 18
% 0.18/0.50 # Positive unorientable unit clauses: 0
% 0.18/0.50 # Negative unit clauses : 3
% 0.18/0.50 # Non-unit-clauses : 194
% 0.18/0.50 # Current number of unprocessed clauses: 817
% 0.18/0.50 # ...number of literals in the above : 3847
% 0.18/0.50 # Current number of archived formulas : 0
% 0.18/0.50 # Current number of archived clauses : 69
% 0.18/0.50 # Clause-clause subsumption calls (NU) : 4129
% 0.18/0.50 # Rec. Clause-clause subsumption calls : 2112
% 0.18/0.50 # Non-unit clause-clause subsumptions : 96
% 0.18/0.50 # Unit Clause-clause subsumption calls : 14
% 0.18/0.50 # Rewrite failures with RHS unbound : 0
% 0.18/0.50 # BW rewrite match attempts : 1
% 0.18/0.50 # BW rewrite match successes : 1
% 0.18/0.50 # Condensation attempts : 0
% 0.18/0.50 # Condensation successes : 0
% 0.18/0.50 # Termbank termtop insertions : 23822
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.032 s
% 0.18/0.50 # System time : 0.001 s
% 0.18/0.50 # Total time : 0.033 s
% 0.18/0.50 # Maximum resident set size: 2056 pages
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.035 s
% 0.18/0.50 # System time : 0.002 s
% 0.18/0.50 # Total time : 0.037 s
% 0.18/0.50 # Maximum resident set size: 1800 pages
% 0.18/0.50 % E---3.1 exiting
% 0.18/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------