TSTP Solution File: SWC385+1 by PyRes---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SWC385+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n005.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:59 EDT 2024
% Result : Theorem 6.57s 6.80s
% Output : Refutation 6.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 13 unt; 0 def)
% Number of atoms : 114 ( 30 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 130 ( 46 ~; 39 |; 33 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 39 ( 0 sgn 12 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry,axiom,
( X251 != X252
| X252 = X251 ),
theory(equality) ).
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ~ neq(V,nil)
| ~ segmentP(X,W)
| ( ~ singletonP(W)
& neq(X,nil) )
| ( singletonP(U)
& segmentP(V,U) ) ) ) ) ) ),
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
| ~ neq(V,nil)
| ~ segmentP(X,W)
| ( ~ singletonP(W)
& neq(X,nil) )
| ( singletonP(U)
& segmentP(V,U) ) ) ) ) ) ),
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
| ~ neq(V,nil)
| ~ segmentP(X,W)
| ( ~ singletonP(W)
& neq(X,nil) )
| ( singletonP(U)
& segmentP(V,U) ) ) ) ) ) ),
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
& neq(V,nil)
& segmentP(X,W)
& ( singletonP(W)
| ~ neq(X,nil) )
& ( ~ singletonP(U)
| ~ segmentP(V,U) ) ) ) ) ),
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
& neq(X3,nil)
& segmentP(X5,X4)
& ( singletonP(X4)
| ~ neq(X5,nil) )
& ( ~ singletonP(X2)
| ~ segmentP(X3,X2) ) ) ) ) ),
inference(variable_rename,[status(thm)],[c25]) ).
fof(c27,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& neq(skolem0002,nil)
& segmentP(skolem0004,skolem0003)
& ( singletonP(skolem0003)
| ~ neq(skolem0004,nil) )
& ( ~ singletonP(skolem0001)
| ~ segmentP(skolem0002,skolem0001) ) ),
inference(skolemize,[status(esa)],[c26]) ).
cnf(c33,negated_conjecture,
skolem0001 = skolem0003,
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c516,plain,
skolem0003 = skolem0001,
inference(resolution,[status(thm)],[c33,symmetry]) ).
cnf(c8,axiom,
( X291 != X290
| ~ singletonP(X291)
| singletonP(X290) ),
theory(equality) ).
cnf(c575,plain,
( ~ singletonP(skolem0003)
| singletonP(skolem0001) ),
inference(resolution,[status(thm)],[c8,c516]) ).
cnf(c36,negated_conjecture,
( singletonP(skolem0003)
| ~ neq(skolem0004,nil) ),
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c32,negated_conjecture,
skolem0002 = skolem0004,
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(reflexivity,axiom,
X250 = X250,
theory(equality) ).
cnf(c34,negated_conjecture,
neq(skolem0002,nil),
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c5,axiom,
( X279 != X278
| X277 != X276
| ~ neq(X279,X277)
| neq(X278,X276) ),
theory(equality) ).
cnf(c557,plain,
( skolem0002 != X744
| nil != X745
| neq(X744,X745) ),
inference(resolution,[status(thm)],[c5,c34]) ).
cnf(c20029,plain,
( skolem0002 != X746
| neq(X746,nil) ),
inference(resolution,[status(thm)],[c557,reflexivity]) ).
cnf(c20031,plain,
neq(skolem0004,nil),
inference(resolution,[status(thm)],[c20029,c32]) ).
cnf(c20036,plain,
singletonP(skolem0003),
inference(resolution,[status(thm)],[c20031,c36]) ).
cnf(c20039,plain,
singletonP(skolem0001),
inference(resolution,[status(thm)],[c20036,c575]) ).
cnf(c37,negated_conjecture,
( ~ singletonP(skolem0001)
| ~ segmentP(skolem0002,skolem0001) ),
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c513,plain,
skolem0004 = skolem0002,
inference(resolution,[status(thm)],[c32,symmetry]) ).
cnf(c35,negated_conjecture,
segmentP(skolem0004,skolem0003),
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c11,axiom,
( X306 != X305
| X304 != X303
| ~ segmentP(X306,X304)
| segmentP(X305,X303) ),
theory(equality) ).
cnf(c608,plain,
( skolem0004 != X805
| skolem0003 != X804
| segmentP(X805,X804) ),
inference(resolution,[status(thm)],[c11,c35]) ).
cnf(c20365,plain,
( skolem0004 != X860
| segmentP(X860,skolem0001) ),
inference(resolution,[status(thm)],[c608,c516]) ).
cnf(c20711,plain,
segmentP(skolem0002,skolem0001),
inference(resolution,[status(thm)],[c20365,c513]) ).
cnf(c20720,plain,
~ singletonP(skolem0001),
inference(resolution,[status(thm)],[c20711,c37]) ).
cnf(c20724,plain,
$false,
inference(resolution,[status(thm)],[c20720,c20039]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWC385+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.15/0.36 % Computer : n005.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 02:56:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 6.57/6.80 % Version: 1.5
% 6.57/6.80 % SZS status Theorem
% 6.57/6.80 % SZS output start CNFRefutation
% See solution above
% 6.57/6.80
% 6.57/6.80 % Initial clauses : 226
% 6.57/6.80 % Processed clauses : 949
% 6.57/6.80 % Factors computed : 44
% 6.57/6.80 % Resolvents computed: 20207
% 6.57/6.80 % Tautologies deleted: 21
% 6.57/6.80 % Forward subsumed : 356
% 6.57/6.80 % Backward subsumed : 6
% 6.57/6.80 % -------- CPU Time ---------
% 6.57/6.80 % User time : 6.379 s
% 6.57/6.80 % System time : 0.049 s
% 6.57/6.80 % Total time : 6.428 s
%------------------------------------------------------------------------------