TSTP Solution File: SWC340+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC340+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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 : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 20:28:08 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 179 ( 19 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 230 ( 82 ~; 94 |; 27 &)
% ( 3 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ strictorderedP(X3)
| ( segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax11,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ strictorderedP(X3)
| ( segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,plain,
! [X7,X8,X9,X10,X11,X12] :
( ( ~ totalorderedP(X7)
| ~ ssItem(X8)
| ~ ssItem(X9)
| ~ ssList(X10)
| ~ ssList(X11)
| ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| leq(X8,X9)
| ~ ssList(X7) )
& ( ssItem(esk5_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssItem(esk6_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk7_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk8_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk9_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( app(app(esk7_1(X7),cons(esk5_1(X7),esk8_1(X7))),cons(esk6_1(X7),esk9_1(X7))) = X7
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ~ leq(esk5_1(X7),esk6_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11])])])])])])]) ).
fof(c_0_6,plain,
! [X3,X4] :
( ( X3 != X4
| ~ lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( leq(X3,X4)
| ~ lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( X3 = X4
| ~ leq(X3,X4)
| lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax93])])])])])]) ).
fof(c_0_7,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& segmentP(esk4_0,esk3_0)
& strictorderedP(esk3_0)
& ( ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) ) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])]) ).
fof(c_0_8,plain,
! [X7,X8,X9,X10,X11,X12] :
( ( ~ strictorderedP(X7)
| ~ ssItem(X8)
| ~ ssItem(X9)
| ~ ssList(X10)
| ~ ssList(X11)
| ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| lt(X8,X9)
| ~ ssList(X7) )
& ( ssItem(esk12_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssItem(esk13_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk14_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk15_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk16_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( app(app(esk14_1(X7),cons(esk12_1(X7),esk15_1(X7))),cons(esk13_1(X7),esk16_1(X7))) = X7
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ~ lt(esk12_1(X7),esk13_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax12])])])])])])]) ).
cnf(c_0_9,plain,
( totalorderedP(X1)
| ~ ssList(X1)
| ~ leq(esk5_1(X1),esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( leq(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( totalorderedP(X1)
| ssItem(esk5_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( totalorderedP(X1)
| ssItem(esk6_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( ~ totalorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
segmentP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
( lt(X2,X3)
| ~ ssList(X1)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ strictorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( totalorderedP(X1)
| app(app(esk7_1(X1),cons(esk5_1(X1),esk8_1(X1))),cons(esk6_1(X1),esk9_1(X1))) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,plain,
( totalorderedP(X1)
| ssList(esk7_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,plain,
( totalorderedP(X1)
| ssList(esk8_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,plain,
( totalorderedP(X1)
| ssList(esk9_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,plain,
( totalorderedP(X1)
| ~ lt(esk5_1(X1),esk6_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]) ).
cnf(c_0_23,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,negated_conjecture,
( ~ totalorderedP(esk1_0)
| ~ segmentP(esk4_0,esk1_0) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_25,negated_conjecture,
segmentP(esk4_0,esk1_0),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_26,plain,
( totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18])]),c_0_11]),c_0_12]),c_0_19]),c_0_20]),c_0_21]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
strictorderedP(esk1_0),
inference(rw,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_29,negated_conjecture,
~ totalorderedP(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC340+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 14:33:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.023 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 31
% 0.25/1.43 # Proof object clause steps : 22
% 0.25/1.43 # Proof object formula steps : 9
% 0.25/1.43 # Proof object conjectures : 14
% 0.25/1.43 # Proof object clause conjectures : 11
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 15
% 0.25/1.43 # Proof object initial formulas used : 4
% 0.25/1.43 # Proof object generating inferences : 3
% 0.25/1.43 # Proof object simplifying inferences : 17
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 96
% 0.25/1.43 # Removed by relevancy pruning/SinE : 45
% 0.25/1.43 # Initial clauses : 96
% 0.25/1.43 # Removed in clause preprocessing : 2
% 0.25/1.43 # Initial clauses in saturation : 94
% 0.25/1.43 # Processed clauses : 1055
% 0.25/1.43 # ...of these trivial : 29
% 0.25/1.43 # ...subsumed : 617
% 0.25/1.43 # ...remaining for further processing : 409
% 0.25/1.43 # Other redundant clauses eliminated : 118
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 9
% 0.25/1.43 # Backward-rewritten : 2
% 0.25/1.43 # Generated clauses : 8202
% 0.25/1.43 # ...of the previous two non-trivial : 7383
% 0.25/1.43 # Contextual simplify-reflections : 529
% 0.25/1.43 # Paramodulations : 8027
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 175
% 0.25/1.43 # Current number of processed clauses : 397
% 0.25/1.43 # Positive orientable unit clauses : 12
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 2
% 0.25/1.43 # Non-unit-clauses : 383
% 0.25/1.43 # Current number of unprocessed clauses: 6294
% 0.25/1.43 # ...number of literals in the above : 48798
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 11
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 31694
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 7937
% 0.25/1.43 # Non-unit clause-clause subsumptions : 1155
% 0.25/1.43 # Unit Clause-clause subsumption calls : 8
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 2
% 0.25/1.43 # BW rewrite match successes : 2
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 176003
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.257 s
% 0.25/1.43 # System time : 0.006 s
% 0.25/1.43 # Total time : 0.264 s
% 0.25/1.43 # Maximum resident set size: 10120 pages
% 0.25/23.43 eprover: CPU time limit exceeded, terminating
% 0.25/23.43 eprover: CPU time limit exceeded, terminating
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------