TSTP Solution File: SWC328+1 by PyRes---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SWC328+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n009.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:51 EDT 2024
% Result : Theorem 5.41s 5.63s
% Output : Refutation 5.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 16 unt; 0 def)
% Number of atoms : 94 ( 35 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 92 ( 33 ~; 27 |; 23 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 36 ( 0 sgn 11 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax74) ).
cnf(c127,plain,
equalelemsP(nil),
inference(split_conjunct,[status(thm)],[ax74]) ).
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil != W
| V != X
| U != W
| ( segmentP(V,U)
& equalelemsP(U) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(c23,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil != W
| V != X
| U != W
| ( segmentP(V,U)
& equalelemsP(U) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c24,negated_conjecture,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& nil = W
& V = X
& U = W
& ( ~ segmentP(V,U)
| ~ equalelemsP(U) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[c23]) ).
fof(c25,negated_conjecture,
? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& nil = X4
& X3 = X5
& X2 = X4
& ( ~ segmentP(X3,X2)
| ~ equalelemsP(X2) ) ) ) ) ),
inference(variable_rename,[status(thm)],[c24]) ).
fof(c26,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& nil = skolem0003
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& ( ~ segmentP(skolem0002,skolem0001)
| ~ equalelemsP(skolem0001) ) ),
inference(skolemize,[status(esa)],[c25]) ).
cnf(c31,negated_conjecture,
nil = skolem0003,
inference(split_conjunct,[status(thm)],[c26]) ).
cnf(c20,axiom,
( X340 != X339
| ~ equalelemsP(X340)
| equalelemsP(X339) ),
theory(equality) ).
cnf(c679,plain,
( ~ equalelemsP(nil)
| equalelemsP(skolem0003) ),
inference(resolution,[status(thm)],[c20,c31]) ).
cnf(c705,plain,
equalelemsP(skolem0003),
inference(resolution,[status(thm)],[c679,c127]) ).
cnf(symmetry,axiom,
( X251 != X252
| X252 = X251 ),
theory(equality) ).
cnf(c33,negated_conjecture,
skolem0001 = skolem0003,
inference(split_conjunct,[status(thm)],[c26]) ).
cnf(c517,plain,
skolem0003 = skolem0001,
inference(resolution,[status(thm)],[c33,symmetry]) ).
cnf(c684,plain,
( ~ equalelemsP(skolem0003)
| equalelemsP(skolem0001) ),
inference(resolution,[status(thm)],[c20,c517]) ).
cnf(c708,plain,
equalelemsP(skolem0001),
inference(resolution,[status(thm)],[c684,c705]) ).
cnf(c34,negated_conjecture,
( ~ segmentP(skolem0002,skolem0001)
| ~ equalelemsP(skolem0001) ),
inference(split_conjunct,[status(thm)],[c26]) ).
cnf(reflexivity,axiom,
X250 = X250,
theory(equality) ).
cnf(transitivity,axiom,
( X253 != X254
| X254 != X255
| X253 = X255 ),
theory(equality) ).
cnf(c511,plain,
skolem0003 = nil,
inference(resolution,[status(thm)],[c31,symmetry]) ).
cnf(c523,plain,
( X388 != skolem0003
| X388 = nil ),
inference(resolution,[status(thm)],[c511,transitivity]) ).
cnf(c754,plain,
skolem0001 = nil,
inference(resolution,[status(thm)],[c523,c33]) ).
cnf(c766,plain,
nil = skolem0001,
inference(resolution,[status(thm)],[c754,symmetry]) ).
cnf(c28,negated_conjecture,
ssList(skolem0002),
inference(split_conjunct,[status(thm)],[c26]) ).
fof(ax57,axiom,
! [U] :
( ssList(U)
=> segmentP(U,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(c178,plain,
! [U] :
( ~ ssList(U)
| segmentP(U,nil) ),
inference(fof_nnf,[status(thm)],[ax57]) ).
fof(c179,plain,
! [X62] :
( ~ ssList(X62)
| segmentP(X62,nil) ),
inference(variable_rename,[status(thm)],[c178]) ).
cnf(c180,plain,
( ~ ssList(X289)
| segmentP(X289,nil) ),
inference(split_conjunct,[status(thm)],[c179]) ).
cnf(c582,plain,
segmentP(skolem0002,nil),
inference(resolution,[status(thm)],[c180,c28]) ).
cnf(c11,axiom,
( X305 != X304
| X303 != X306
| ~ segmentP(X305,X303)
| segmentP(X304,X306) ),
theory(equality) ).
cnf(c619,plain,
( skolem0002 != X805
| nil != X806
| segmentP(X805,X806) ),
inference(resolution,[status(thm)],[c11,c582]) ).
cnf(c14602,plain,
( skolem0002 != X886
| segmentP(X886,skolem0001) ),
inference(resolution,[status(thm)],[c619,c766]) ).
cnf(c15692,plain,
segmentP(skolem0002,skolem0001),
inference(resolution,[status(thm)],[c14602,reflexivity]) ).
cnf(c15702,plain,
~ equalelemsP(skolem0001),
inference(resolution,[status(thm)],[c15692,c34]) ).
cnf(c15704,plain,
$false,
inference(resolution,[status(thm)],[c15702,c708]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC328+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 9 02:45:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 5.41/5.63 % Version: 1.5
% 5.41/5.63 % SZS status Theorem
% 5.41/5.63 % SZS output start CNFRefutation
% See solution above
% 5.41/5.63
% 5.41/5.63 % Initial clauses : 224
% 5.41/5.63 % Processed clauses : 932
% 5.41/5.63 % Factors computed : 44
% 5.41/5.63 % Resolvents computed: 15157
% 5.41/5.63 % Tautologies deleted: 23
% 5.41/5.63 % Forward subsumed : 495
% 5.41/5.63 % Backward subsumed : 21
% 5.41/5.63 % -------- CPU Time ---------
% 5.41/5.63 % User time : 5.197 s
% 5.41/5.63 % System time : 0.049 s
% 5.41/5.63 % Total time : 5.246 s
%------------------------------------------------------------------------------