TSTP Solution File: SWC346+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC346+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:32 EDT 2023
% Result : Theorem 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 13 unt; 0 def)
% Number of atoms : 188 ( 61 equ)
% Maximal formula atoms : 44 ( 4 avg)
% Number of connectives : 223 ( 77 ~; 90 |; 38 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn; 30 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( segmentP(X2,X1)
& strictorderedP(X1) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.440iVjNiq2/E---3.1_11644.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.440iVjNiq2/E---3.1_11644.p',ax7) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.440iVjNiq2/E---3.1_11644.p',ax18) ).
fof(ax68,axiom,
! [X1] :
( ssItem(X1)
=> strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/tmp/tmp.440iVjNiq2/E---3.1_11644.p',ax68) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.440iVjNiq2/E---3.1_11644.p',ax17) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.440iVjNiq2/E---3.1_11644.p',ax58) ).
fof(ax69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/tmp/tmp.440iVjNiq2/E---3.1_11644.p',ax69) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( segmentP(X2,X1)
& strictorderedP(X1) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_8,plain,
! [X33,X34,X37,X38] :
( ( ssList(esk13_2(X33,X34))
| ~ segmentP(X33,X34)
| ~ ssList(X34)
| ~ ssList(X33) )
& ( ssList(esk14_2(X33,X34))
| ~ segmentP(X33,X34)
| ~ ssList(X34)
| ~ ssList(X33) )
& ( app(app(esk13_2(X33,X34),X34),esk14_2(X33,X34)) = X33
| ~ segmentP(X33,X34)
| ~ ssList(X34)
| ~ ssList(X33) )
& ( ~ ssList(X37)
| ~ ssList(X38)
| app(app(X37,X34),X38) != X33
| segmentP(X33,X34)
| ~ ssList(X34)
| ~ ssList(X33) ) ),
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_9,negated_conjecture,
! [X17,X18] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk4_0
| ssItem(esk5_0) )
& ( nil = esk3_0
| ssItem(esk5_0) )
& ( nil = esk4_0
| ssList(esk6_0) )
& ( nil = esk3_0
| ssList(esk6_0) )
& ( nil = esk4_0
| ssList(esk7_0) )
& ( nil = esk3_0
| ssList(esk7_0) )
& ( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk4_0
| app(app(esk6_0,esk3_0),esk7_0) = esk4_0 )
& ( nil = esk3_0
| app(app(esk6_0,esk3_0),esk7_0) = esk4_0 )
& ( nil = esk4_0
| ~ ssItem(X17)
| ~ memberP(esk6_0,X17)
| ~ lt(esk5_0,X17) )
& ( nil = esk3_0
| ~ ssItem(X17)
| ~ memberP(esk6_0,X17)
| ~ lt(esk5_0,X17) )
& ( nil = esk4_0
| ~ ssItem(X18)
| ~ memberP(esk7_0,X18)
| ~ lt(X18,esk5_0) )
& ( nil = esk3_0
| ~ ssItem(X18)
| ~ memberP(esk7_0,X18)
| ~ lt(X18,esk5_0) )
& ( ~ segmentP(esk2_0,esk1_0)
| ~ strictorderedP(esk1_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_7])])])])]) ).
fof(c_0_10,plain,
! [X106,X107] :
( ~ ssList(X106)
| ~ ssItem(X107)
| cons(X107,X106) != X106 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
cnf(c_0_11,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_8]) ).
cnf(c_0_12,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X30] :
( ~ ssItem(X30)
| strictorderedP(cons(X30,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax68])]) ).
cnf(c_0_17,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ strictorderedP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_21,negated_conjecture,
( nil = esk4_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,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_11]) ).
cnf(c_0_23,negated_conjecture,
( nil = esk3_0
| app(app(esk6_0,esk3_0),esk7_0) = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_26,negated_conjecture,
( nil = esk3_0
| ssList(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,negated_conjecture,
( nil = esk3_0
| ssList(esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,negated_conjecture,
( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,negated_conjecture,
( nil = esk3_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_31,plain,
! [X50] :
( ( ~ segmentP(nil,X50)
| nil = X50
| ~ ssList(X50) )
& ( nil != X50
| segmentP(nil,X50)
| ~ ssList(X50) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
cnf(c_0_32,negated_conjecture,
( ~ strictorderedP(esk3_0)
| ~ segmentP(esk4_0,esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_15]),c_0_13]),c_0_15]) ).
cnf(c_0_33,negated_conjecture,
( esk4_0 = nil
| esk3_0 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_34,negated_conjecture,
( esk3_0 = nil
| segmentP(esk4_0,esk3_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]),c_0_26]),c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( esk3_0 = nil
| strictorderedP(esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_36,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( esk3_0 != nil
| ~ strictorderedP(esk3_0)
| ~ segmentP(nil,esk3_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
esk3_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_34]),c_0_35]) ).
cnf(c_0_39,plain,
strictorderedP(nil),
inference(split_conjunct,[status(thm)],[ax69]) ).
cnf(c_0_40,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_36]),c_0_20])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_38]),c_0_39]),c_0_38]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC346+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 02:10:16 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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.440iVjNiq2/E---3.1_11644.p
% 0.17/0.49 # Version: 3.1pre001
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # new_bool_3 with pid 11725 completed with status 0
% 0.17/0.49 # Result found by new_bool_3
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.49 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.17/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11729 completed with status 0
% 0.17/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.49 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.17/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.49 # Preprocessing time : 0.005 s
% 0.17/0.49 # Presaturation interreduction done
% 0.17/0.49
% 0.17/0.49 # Proof found!
% 0.17/0.49 # SZS status Theorem
% 0.17/0.49 # SZS output start CNFRefutation
% See solution above
% 0.17/0.49 # Parsed axioms : 96
% 0.17/0.49 # Removed by relevancy pruning/SinE : 45
% 0.17/0.49 # Initial clauses : 104
% 0.17/0.49 # Removed in clause preprocessing : 1
% 0.17/0.49 # Initial clauses in saturation : 103
% 0.17/0.49 # Processed clauses : 267
% 0.17/0.49 # ...of these trivial : 2
% 0.17/0.49 # ...subsumed : 10
% 0.17/0.49 # ...remaining for further processing : 255
% 0.17/0.49 # Other redundant clauses eliminated : 17
% 0.17/0.49 # Clauses deleted for lack of memory : 0
% 0.17/0.49 # Backward-subsumed : 0
% 0.17/0.49 # Backward-rewritten : 44
% 0.17/0.49 # Generated clauses : 753
% 0.17/0.49 # ...of the previous two non-redundant : 688
% 0.17/0.49 # ...aggressively subsumed : 0
% 0.17/0.49 # Contextual simplify-reflections : 20
% 0.17/0.49 # Paramodulations : 733
% 0.17/0.49 # Factorizations : 0
% 0.17/0.49 # NegExts : 0
% 0.17/0.49 # Equation resolutions : 21
% 0.17/0.49 # Total rewrite steps : 190
% 0.17/0.49 # Propositional unsat checks : 0
% 0.17/0.49 # Propositional check models : 0
% 0.17/0.49 # Propositional check unsatisfiable : 0
% 0.17/0.49 # Propositional clauses : 0
% 0.17/0.49 # Propositional clauses after purity: 0
% 0.17/0.49 # Propositional unsat core size : 0
% 0.17/0.49 # Propositional preprocessing time : 0.000
% 0.17/0.49 # Propositional encoding time : 0.000
% 0.17/0.49 # Propositional solver time : 0.000
% 0.17/0.49 # Success case prop preproc time : 0.000
% 0.17/0.49 # Success case prop encoding time : 0.000
% 0.17/0.49 # Success case prop solver time : 0.000
% 0.17/0.49 # Current number of processed clauses : 105
% 0.17/0.49 # Positive orientable unit clauses : 9
% 0.17/0.49 # Positive unorientable unit clauses: 0
% 0.17/0.49 # Negative unit clauses : 1
% 0.17/0.49 # Non-unit-clauses : 95
% 0.17/0.49 # Current number of unprocessed clauses: 619
% 0.17/0.49 # ...number of literals in the above : 2766
% 0.17/0.49 # Current number of archived formulas : 0
% 0.17/0.49 # Current number of archived clauses : 142
% 0.17/0.49 # Clause-clause subsumption calls (NU) : 2605
% 0.17/0.49 # Rec. Clause-clause subsumption calls : 613
% 0.17/0.49 # Non-unit clause-clause subsumptions : 30
% 0.17/0.49 # Unit Clause-clause subsumption calls : 2
% 0.17/0.49 # Rewrite failures with RHS unbound : 0
% 0.17/0.49 # BW rewrite match attempts : 1
% 0.17/0.49 # BW rewrite match successes : 1
% 0.17/0.49 # Condensation attempts : 0
% 0.17/0.49 # Condensation successes : 0
% 0.17/0.49 # Termbank termtop insertions : 18967
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.025 s
% 0.17/0.49 # System time : 0.006 s
% 0.17/0.49 # Total time : 0.031 s
% 0.17/0.49 # Maximum resident set size: 2168 pages
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.027 s
% 0.17/0.49 # System time : 0.008 s
% 0.17/0.49 # Total time : 0.036 s
% 0.17/0.49 # Maximum resident set size: 1804 pages
% 0.17/0.49 % E---3.1 exiting
% 0.17/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------