TSTP Solution File: SWC372+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC372+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:40 EDT 2023
% Result : Theorem 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 121 ( 31 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 149 ( 53 ~; 50 |; 30 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn; 26 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
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.RZ6H0c09Ot/E---3.1_19971.p',ax7) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| segmentP(X2,X1)
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.RZ6H0c09Ot/E---3.1_19971.p',co1) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.RZ6H0c09Ot/E---3.1_19971.p',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.RZ6H0c09Ot/E---3.1_19971.p',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.RZ6H0c09Ot/E---3.1_19971.p',ax17) ).
fof(c_0_5,plain,
! [X30,X31,X34,X35] :
( ( ssList(esk8_2(X30,X31))
| ~ segmentP(X30,X31)
| ~ ssList(X31)
| ~ ssList(X30) )
& ( ssList(esk9_2(X30,X31))
| ~ segmentP(X30,X31)
| ~ ssList(X31)
| ~ ssList(X30) )
& ( app(app(esk8_2(X30,X31),X31),esk9_2(X30,X31)) = X30
| ~ segmentP(X30,X31)
| ~ ssList(X31)
| ~ ssList(X30) )
& ( ~ ssList(X34)
| ~ ssList(X35)
| app(app(X34,X31),X35) != X30
| segmentP(X30,X31)
| ~ ssList(X31)
| ~ ssList(X30) ) ),
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_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| segmentP(X2,X1)
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
cnf(c_0_7,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_5]) ).
fof(c_0_8,plain,
! [X24] :
( ~ ssList(X24)
| app(nil,X24) = X24 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_9,plain,
! [X95,X96] :
( ~ ssList(X95)
| ~ ssList(X96)
| ssList(app(X95,X96)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_10,negated_conjecture,
! [X15,X16,X17,X18] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& app(esk3_0,esk5_0) = esk4_0
& strictorderedP(esk3_0)
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk5_0
| ~ ssItem(X17)
| ~ ssList(X18)
| app(X18,cons(X17,nil)) != esk3_0
| ~ lt(X17,X15) )
& ~ segmentP(esk2_0,esk1_0)
& ( nil = esk4_0
| nil != esk3_0 ) ),
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_11,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_7]) ).
cnf(c_0_12,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_14,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,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_11,c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_20,negated_conjecture,
app(esk3_0,esk5_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SWC372+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 01:40:57 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.RZ6H0c09Ot/E---3.1_19971.p
% 0.20/0.60 # Version: 3.1pre001
% 0.20/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.60 # Starting sh5l with 300s (1) cores
% 0.20/0.60 # sh5l with pid 20053 completed with status 0
% 0.20/0.60 # Result found by sh5l
% 0.20/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.60 # Starting sh5l with 300s (1) cores
% 0.20/0.60 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.60 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.20/0.60 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.60 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.20/0.60 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 20056 completed with status 0
% 0.20/0.60 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.20/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.60 # Starting sh5l with 300s (1) cores
% 0.20/0.60 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.60 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.20/0.60 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.60 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.20/0.60 # Preprocessing time : 0.003 s
% 0.20/0.60 # Presaturation interreduction done
% 0.20/0.60
% 0.20/0.60 # Proof found!
% 0.20/0.60 # SZS status Theorem
% 0.20/0.60 # SZS output start CNFRefutation
% See solution above
% 0.20/0.60 # Parsed axioms : 96
% 0.20/0.60 # Removed by relevancy pruning/SinE : 14
% 0.20/0.60 # Initial clauses : 164
% 0.20/0.60 # Removed in clause preprocessing : 2
% 0.20/0.60 # Initial clauses in saturation : 162
% 0.20/0.60 # Processed clauses : 759
% 0.20/0.60 # ...of these trivial : 14
% 0.20/0.60 # ...subsumed : 178
% 0.20/0.60 # ...remaining for further processing : 567
% 0.20/0.60 # Other redundant clauses eliminated : 57
% 0.20/0.60 # Clauses deleted for lack of memory : 0
% 0.20/0.60 # Backward-subsumed : 27
% 0.20/0.60 # Backward-rewritten : 42
% 0.20/0.60 # Generated clauses : 1824
% 0.20/0.60 # ...of the previous two non-redundant : 1388
% 0.20/0.60 # ...aggressively subsumed : 0
% 0.20/0.60 # Contextual simplify-reflections : 65
% 0.20/0.60 # Paramodulations : 1763
% 0.20/0.60 # Factorizations : 0
% 0.20/0.60 # NegExts : 0
% 0.20/0.60 # Equation resolutions : 62
% 0.20/0.60 # Total rewrite steps : 1856
% 0.20/0.60 # Propositional unsat checks : 0
% 0.20/0.60 # Propositional check models : 0
% 0.20/0.60 # Propositional check unsatisfiable : 0
% 0.20/0.60 # Propositional clauses : 0
% 0.20/0.60 # Propositional clauses after purity: 0
% 0.20/0.60 # Propositional unsat core size : 0
% 0.20/0.60 # Propositional preprocessing time : 0.000
% 0.20/0.60 # Propositional encoding time : 0.000
% 0.20/0.60 # Propositional solver time : 0.000
% 0.20/0.60 # Success case prop preproc time : 0.000
% 0.20/0.60 # Success case prop encoding time : 0.000
% 0.20/0.60 # Success case prop solver time : 0.000
% 0.20/0.60 # Current number of processed clauses : 326
% 0.20/0.60 # Positive orientable unit clauses : 56
% 0.20/0.60 # Positive unorientable unit clauses: 0
% 0.20/0.60 # Negative unit clauses : 2
% 0.20/0.60 # Non-unit-clauses : 268
% 0.20/0.60 # Current number of unprocessed clauses: 822
% 0.20/0.60 # ...number of literals in the above : 4654
% 0.20/0.60 # Current number of archived formulas : 0
% 0.20/0.60 # Current number of archived clauses : 225
% 0.20/0.60 # Clause-clause subsumption calls (NU) : 26133
% 0.20/0.60 # Rec. Clause-clause subsumption calls : 10509
% 0.20/0.60 # Non-unit clause-clause subsumptions : 270
% 0.20/0.60 # Unit Clause-clause subsumption calls : 2961
% 0.20/0.60 # Rewrite failures with RHS unbound : 0
% 0.20/0.60 # BW rewrite match attempts : 16
% 0.20/0.60 # BW rewrite match successes : 16
% 0.20/0.60 # Condensation attempts : 0
% 0.20/0.60 # Condensation successes : 0
% 0.20/0.60 # Termbank termtop insertions : 44338
% 0.20/0.60
% 0.20/0.60 # -------------------------------------------------
% 0.20/0.60 # User time : 0.084 s
% 0.20/0.60 # System time : 0.005 s
% 0.20/0.60 # Total time : 0.089 s
% 0.20/0.60 # Maximum resident set size: 2376 pages
% 0.20/0.60
% 0.20/0.60 # -------------------------------------------------
% 0.20/0.60 # User time : 0.090 s
% 0.20/0.60 # System time : 0.005 s
% 0.20/0.60 # Total time : 0.095 s
% 0.20/0.60 # Maximum resident set size: 1800 pages
% 0.20/0.60 % E---3.1 exiting
% 0.20/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------