TSTP Solution File: SWC293+1 by PyRes---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SWC293+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 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 : 300s
% DateTime : Thu May 9 17:43:47 EDT 2024
% Result : Theorem 14.40s 14.60s
% Output : Refutation 14.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 10 unt; 0 def)
% Number of atoms : 134 ( 50 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 143 ( 41 ~; 47 |; 45 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 18 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ~ ssList(X)
| V != X
| U != W
| strictorderedP(U)
| ( ! [Y] :
( ~ ssItem(Y)
| cons(Y,nil) != W
| ~ memberP(X,Y) )
& ( nil != X
| nil != W ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(c23,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ~ ssList(X)
| V != X
| U != W
| strictorderedP(U)
| ( ! [Y] :
( ~ ssItem(Y)
| cons(Y,nil) != W
| ~ memberP(X,Y) )
& ( nil != X
| nil != W ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c24,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ~ ssList(X)
| V != X
| U != W
| strictorderedP(U)
| ( ! [Y] :
( ~ ssItem(Y)
| cons(Y,nil) != W
| ~ memberP(X,Y) )
& ( nil != X
| nil != W ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c23]) ).
fof(c25,negated_conjecture,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ~ strictorderedP(U)
& ( ? [Y] :
( ssItem(Y)
& cons(Y,nil) = W
& memberP(X,Y) )
| ( nil = X
& nil = W ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[c24]) ).
fof(c26,negated_conjecture,
? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& X3 = X5
& X2 = X4
& ~ strictorderedP(X2)
& ( ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X4
& memberP(X5,X6) )
| ( nil = X5
& nil = X4 ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[c25]) ).
fof(c27,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& ~ strictorderedP(skolem0001)
& ( ( ssItem(skolem0005)
& cons(skolem0005,nil) = skolem0003
& memberP(skolem0004,skolem0005) )
| ( nil = skolem0004
& nil = skolem0003 ) ) ),
inference(skolemize,[status(esa)],[c26]) ).
fof(c28,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& ~ strictorderedP(skolem0001)
& ( ssItem(skolem0005)
| nil = skolem0004 )
& ( ssItem(skolem0005)
| nil = skolem0003 )
& ( cons(skolem0005,nil) = skolem0003
| nil = skolem0004 )
& ( cons(skolem0005,nil) = skolem0003
| nil = skolem0003 )
& ( memberP(skolem0004,skolem0005)
| nil = skolem0004 )
& ( memberP(skolem0004,skolem0005)
| nil = skolem0003 ) ),
inference(distribute,[status(thm)],[c27]) ).
cnf(c35,negated_conjecture,
~ strictorderedP(skolem0001),
inference(split_conjunct,[status(thm)],[c28]) ).
cnf(symmetry,axiom,
( X253 != X252
| X252 = X253 ),
theory(equality) ).
cnf(c34,negated_conjecture,
skolem0001 = skolem0003,
inference(split_conjunct,[status(thm)],[c28]) ).
cnf(c520,plain,
skolem0003 = skolem0001,
inference(resolution,[status(thm)],[c34,symmetry]) ).
cnf(c18,axiom,
( X334 != X335
| ~ strictorderedP(X334)
| strictorderedP(X335) ),
theory(equality) ).
cnf(c644,plain,
( ~ strictorderedP(skolem0003)
| strictorderedP(skolem0001) ),
inference(resolution,[status(thm)],[c18,c520]) ).
fof(ax69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax69) ).
cnf(c151,plain,
strictorderedP(nil),
inference(split_conjunct,[status(thm)],[ax69]) ).
fof(ax68,axiom,
! [U] :
( ssItem(U)
=> strictorderedP(cons(U,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax68) ).
fof(c152,plain,
! [U] :
( ~ ssItem(U)
| strictorderedP(cons(U,nil)) ),
inference(fof_nnf,[status(thm)],[ax68]) ).
fof(c153,plain,
! [X55] :
( ~ ssItem(X55)
| strictorderedP(cons(X55,nil)) ),
inference(variable_rename,[status(thm)],[c152]) ).
cnf(c154,plain,
( ~ ssItem(X353)
| strictorderedP(cons(X353,nil)) ),
inference(split_conjunct,[status(thm)],[c153]) ).
cnf(c37,negated_conjecture,
( ssItem(skolem0005)
| nil = skolem0003 ),
inference(split_conjunct,[status(thm)],[c28]) ).
cnf(c680,plain,
( ssItem(skolem0005)
| ~ strictorderedP(nil)
| strictorderedP(skolem0003) ),
inference(resolution,[status(thm)],[c37,c18]) ).
cnf(c25625,plain,
( ssItem(skolem0005)
| strictorderedP(skolem0003) ),
inference(resolution,[status(thm)],[c680,c151]) ).
cnf(c25648,plain,
( ssItem(skolem0005)
| strictorderedP(skolem0001) ),
inference(resolution,[status(thm)],[c25625,c644]) ).
cnf(c25664,plain,
ssItem(skolem0005),
inference(resolution,[status(thm)],[c25648,c35]) ).
cnf(c25665,plain,
strictorderedP(cons(skolem0005,nil)),
inference(resolution,[status(thm)],[c25664,c154]) ).
cnf(c39,negated_conjecture,
( cons(skolem0005,nil) = skolem0003
| nil = skolem0003 ),
inference(split_conjunct,[status(thm)],[c28]) ).
cnf(c744,plain,
( nil = skolem0003
| ~ strictorderedP(cons(skolem0005,nil))
| strictorderedP(skolem0003) ),
inference(resolution,[status(thm)],[c39,c18]) ).
cnf(c28311,plain,
( nil = skolem0003
| strictorderedP(skolem0003) ),
inference(resolution,[status(thm)],[c744,c25665]) ).
cnf(c29711,plain,
( strictorderedP(skolem0003)
| ~ strictorderedP(nil) ),
inference(resolution,[status(thm)],[c28311,c18]) ).
cnf(c29771,plain,
strictorderedP(skolem0003),
inference(resolution,[status(thm)],[c29711,c151]) ).
cnf(c29772,plain,
strictorderedP(skolem0001),
inference(resolution,[status(thm)],[c29771,c644]) ).
cnf(c29773,plain,
$false,
inference(resolution,[status(thm)],[c29772,c35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC293+1 : TPTP v8.1.2. Released v2.4.0.
% 0.15/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu May 9 03:17:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 14.40/14.60 % Version: 1.5
% 14.40/14.60 % SZS status Theorem
% 14.40/14.60 % SZS output start CNFRefutation
% See solution above
% 14.40/14.60
% 14.40/14.60 % Initial clauses : 229
% 14.40/14.60 % Processed clauses : 1252
% 14.40/14.60 % Factors computed : 44
% 14.40/14.60 % Resolvents computed: 29219
% 14.40/14.60 % Tautologies deleted: 14
% 14.40/14.60 % Forward subsumed : 706
% 14.40/14.60 % Backward subsumed : 260
% 14.40/14.60 % -------- CPU Time ---------
% 14.40/14.60 % User time : 14.180 s
% 14.40/14.60 % System time : 0.056 s
% 14.40/14.60 % Total time : 14.236 s
%------------------------------------------------------------------------------