%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SWC276+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n032.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:44 EDT 2024
% Result : Theorem 14.33s 14.55s
% Output : Refutation 14.33s
% 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 : 137 ( 35 ~; 41 |; 45 &)
% ( 0 <=>; 16 =>; 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
| totalorderedP(U)
| ( ! [Y] :
( ssItem(Y)
=> ( cons(Y,nil) != W
| ~ memberP(X,Y) ) )
& ( nil != X
| nil != W ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(c23,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| totalorderedP(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
| totalorderedP(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
& ~ totalorderedP(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
& ~ totalorderedP(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
& ~ totalorderedP(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
& ~ totalorderedP(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,
~ totalorderedP(skolem0001),
inference(split_conjunct,[status(thm)],[c28]) ).
cnf(symmetry,axiom,
( X252 != X253
| X253 = X252 ),
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(c17,axiom,
( X332 != X331
| ~ totalorderedP(X332)
| totalorderedP(X331) ),
theory(equality) ).
cnf(c641,plain,
( ~ totalorderedP(skolem0003)
| totalorderedP(skolem0001) ),
inference(resolution,[status(thm)],[c17,c520]) ).
fof(ax66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax66) ).
cnf(c164,plain,
totalorderedP(nil),
inference(split_conjunct,[status(thm)],[ax66]) ).
fof(ax65,axiom,
! [U] :
( ssItem(U)
=> totalorderedP(cons(U,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax65) ).
fof(c165,plain,
! [U] :
( ~ ssItem(U)
| totalorderedP(cons(U,nil)) ),
inference(fof_nnf,[status(thm)],[ax65]) ).
fof(c166,plain,
! [X58] :
( ~ ssItem(X58)
| totalorderedP(cons(X58,nil)) ),
inference(variable_rename,[status(thm)],[c165]) ).
cnf(c167,plain,
( ~ ssItem(X354)
| totalorderedP(cons(X354,nil)) ),
inference(split_conjunct,[status(thm)],[c166]) ).
cnf(c37,negated_conjecture,
( ssItem(skolem0005)
| nil = skolem0003 ),
inference(split_conjunct,[status(thm)],[c28]) ).
cnf(c686,plain,
( ssItem(skolem0005)
| ~ totalorderedP(nil)
| totalorderedP(skolem0003) ),
inference(resolution,[status(thm)],[c37,c17]) ).
cnf(c26019,plain,
( ssItem(skolem0005)
| totalorderedP(skolem0003) ),
inference(resolution,[status(thm)],[c686,c164]) ).
cnf(c26035,plain,
( ssItem(skolem0005)
| totalorderedP(skolem0001) ),
inference(resolution,[status(thm)],[c26019,c641]) ).
cnf(c26051,plain,
ssItem(skolem0005),
inference(resolution,[status(thm)],[c26035,c35]) ).
cnf(c26053,plain,
totalorderedP(cons(skolem0005,nil)),
inference(resolution,[status(thm)],[c26051,c167]) ).
cnf(c39,negated_conjecture,
( cons(skolem0005,nil) = skolem0003
| nil = skolem0003 ),
inference(split_conjunct,[status(thm)],[c28]) ).
cnf(c750,plain,
( nil = skolem0003
| ~ totalorderedP(cons(skolem0005,nil))
| totalorderedP(skolem0003) ),
inference(resolution,[status(thm)],[c39,c17]) ).
cnf(c28862,plain,
( nil = skolem0003
| totalorderedP(skolem0003) ),
inference(resolution,[status(thm)],[c750,c26053]) ).
cnf(c30553,plain,
( totalorderedP(skolem0003)
| ~ totalorderedP(nil) ),
inference(resolution,[status(thm)],[c28862,c17]) ).
cnf(c30608,plain,
totalorderedP(skolem0003),
inference(resolution,[status(thm)],[c30553,c164]) ).
cnf(c30609,plain,
totalorderedP(skolem0001),
inference(resolution,[status(thm)],[c30608,c641]) ).
cnf(c30610,plain,
$false,
inference(resolution,[status(thm)],[c30609,c35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.11 % Problem : SWC276+1 : TPTP v8.1.2. Released v2.4.0.
% 0.01/0.11 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.10/0.32 % Computer : n032.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Thu May 9 02:25:22 EDT 2024
% 0.10/0.32 % CPUTime :
% 14.33/14.55 % Version: 1.5
% 14.33/14.55 % SZS status Theorem
% 14.33/14.55 % SZS output start CNFRefutation
% See solution above
% 14.33/14.55
% 14.33/14.55 % Initial clauses : 229
% 14.33/14.55 % Processed clauses : 1271
% 14.33/14.55 % Factors computed : 44
% 14.33/14.55 % Resolvents computed: 30056
% 14.33/14.55 % Tautologies deleted: 14
% 14.33/14.55 % Forward subsumed : 722
% 14.33/14.55 % Backward subsumed : 320
% 14.33/14.55 % -------- CPU Time ---------
% 14.33/14.55 % User time : 14.165 s
% 14.33/14.55 % System time : 0.067 s
% 14.33/14.55 % Total time : 14.232 s
%------------------------------------------------------------------------------