%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SWC151+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n018.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:27 EDT 2024
% Result : Theorem 0.67s 0.89s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 58 ( 14 equ)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 63 ( 18 ~; 12 |; 21 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 22 ( 0 sgn 12 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ~ totalorderP(V)
| totalorderP(X) ) ) ) ) ),
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
| ~ totalorderP(V)
| totalorderP(X) ) ) ) ) ),
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
| ~ totalorderP(V)
| totalorderP(X) ) ) ) ) ),
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
& totalorderP(V)
& ~ totalorderP(X) ) ) ) ),
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
& totalorderP(X3)
& ~ totalorderP(X5) ) ) ) ),
inference(variable_rename,[status(thm)],[c25]) ).
fof(c27,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& totalorderP(skolem0002)
& ~ totalorderP(skolem0004) ),
inference(skolemize,[status(esa)],[c26]) ).
cnf(c35,negated_conjecture,
~ totalorderP(skolem0004),
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c34,negated_conjecture,
totalorderP(skolem0002),
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c32,negated_conjecture,
skolem0002 = skolem0004,
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c14,axiom,
( X320 != X321
| ~ totalorderP(X320)
| totalorderP(X321) ),
theory(equality) ).
cnf(c621,plain,
( ~ totalorderP(skolem0002)
| totalorderP(skolem0004) ),
inference(resolution,[status(thm)],[c14,c32]) ).
cnf(c631,plain,
totalorderP(skolem0004),
inference(resolution,[status(thm)],[c621,c34]) ).
cnf(c632,plain,
$false,
inference(resolution,[status(thm)],[c631,c35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWC151+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.15 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu May 9 02:33:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.67/0.89 % Version: 1.5
% 0.67/0.89 % SZS status Theorem
% 0.67/0.89 % SZS output start CNFRefutation
% See solution above
% 0.67/0.89
% 0.67/0.89 % Initial clauses : 224
% 0.67/0.89 % Processed clauses : 97
% 0.67/0.89 % Factors computed : 3
% 0.67/0.89 % Resolvents computed: 125
% 0.67/0.89 % Tautologies deleted: 8
% 0.67/0.89 % Forward subsumed : 12
% 0.67/0.89 % Backward subsumed : 1
% 0.67/0.89 % -------- CPU Time ---------
% 0.67/0.89 % User time : 0.510 s
% 0.67/0.89 % System time : 0.015 s
% 0.67/0.89 % Total time : 0.525 s
%------------------------------------------------------------------------------