TSTP Solution File: SWC032+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC032+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:13:10 EDT 2022
% Result : Theorem 7.44s 2.48s
% Output : CNFRefutation 7.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 10 unt; 0 def)
% Number of atoms : 110 ( 63 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 136 ( 46 ~; 44 |; 33 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 18 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
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) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(c_0_2,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) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_3,negated_conjecture,
! [X259,X260,X261,X262] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssList(esk52_0)
& app(esk50_0,esk52_0) = esk51_0
& strictorderedP(esk50_0)
& ( ~ ssItem(X259)
| ~ ssList(X260)
| app(cons(X259,nil),X260) != esk52_0
| ~ ssItem(X261)
| ~ ssList(X262)
| app(X262,cons(X261,nil)) != esk50_0
| ~ lt(X261,X259) )
& ( nil = esk51_0
| nil != esk50_0 )
& ( nil = esk48_0
| nil = esk49_0 )
& ( nil != esk49_0
| nil = esk49_0 )
& ( nil = esk48_0
| nil != esk48_0 )
& ( nil != esk49_0
| nil != esk48_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])])])])])]) ).
cnf(c_0_4,negated_conjecture,
( nil != esk49_0
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( nil = esk51_0
| nil != esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( esk50_0 != nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( nil = esk48_0
| nil = esk49_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
esk50_0 != nil,
inference(csr,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_11,plain,
! [X228,X229] :
( ( nil = X229
| nil != app(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) )
& ( nil = X228
| nil != app(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) )
& ( nil != X229
| nil != X228
| nil = app(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_12,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
esk51_0 = nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_5]),c_0_6]),c_0_10]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
app(esk50_0,esk52_0) = nil,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_14,c_0_5]) ).
cnf(c_0_19,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_15,c_0_16]),c_0_17]),c_0_18])]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWC032+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 09:02:50 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.44/2.48 # ENIGMATIC: Solved by autoschedule:
% 7.44/2.48 # No SInE strategy applied
% 7.44/2.48 # Trying AutoSched0 for 150 seconds
% 7.44/2.48 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 7.44/2.48 # and selection function SelectNewComplexAHP.
% 7.44/2.48 #
% 7.44/2.48 # Preprocessing time : 0.021 s
% 7.44/2.48 # Presaturation interreduction done
% 7.44/2.48
% 7.44/2.48 # Proof found!
% 7.44/2.48 # SZS status Theorem
% 7.44/2.48 # SZS output start CNFRefutation
% See solution above
% 7.44/2.48 # Training examples: 0 positive, 0 negative
% 7.44/2.48
% 7.44/2.48 # -------------------------------------------------
% 7.44/2.48 # User time : 0.030 s
% 7.44/2.48 # System time : 0.007 s
% 7.44/2.48 # Total time : 0.036 s
% 7.44/2.48 # Maximum resident set size: 7124 pages
% 7.44/2.48
%------------------------------------------------------------------------------