TSTP Solution File: SWV151+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWV151+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n020.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 : 600s
% DateTime : Wed Jul 20 21:15:59 EDT 2022
% Result : Theorem 33.61s 33.82s
% Output : Refutation 33.61s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named eq_axiom)
% Comments :
%------------------------------------------------------------------------------
fof(irreflexivity_gt,axiom,
! [X] : ~ gt(X,X),
input ).
fof(c451,axiom,
! [X] : ~ gt(X,X),
inference(fof_simplification,status(thm),[irreflexivity_gt]) ).
fof(c452,axiom,
! [X175] : ~ gt(X175,X175),
inference(variable_rename,status(thm),[c451]) ).
cnf(c453,axiom,
~ gt(X183,X183),
inference(split_conjunct,status(thm),[c452]) ).
fof(leq_succ_gt,axiom,
! [X,Y] :
( leq(succ(X),Y)
=> gt(Y,X) ),
input ).
fof(c108,axiom,
! [X,Y] :
( ~ leq(succ(X),Y)
| gt(Y,X) ),
inference(fof_nnf,status(thm),[leq_succ_gt]) ).
fof(c109,axiom,
! [X43,X44] :
( ~ leq(succ(X43),X44)
| gt(X44,X43) ),
inference(variable_rename,status(thm),[c108]) ).
cnf(c110,axiom,
( ~ leq(succ(X318),X317)
| gt(X317,X318) ),
inference(split_conjunct,status(thm),[c109]) ).
fof(cl5_nebula_norm_0001,conjecture,
! [A] :
( ( leq(n0,A)
& leq(A,tptp_minus_1) )
=> sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1 ),
input ).
fof(c66,negated_conjecture,
~ ! [A] :
( ( leq(n0,A)
& leq(A,tptp_minus_1) )
=> sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1 ),
inference(assume_negation,status(cth),[cl5_nebula_norm_0001]) ).
fof(c67,negated_conjecture,
? [A] :
( leq(n0,A)
& leq(A,tptp_minus_1)
& sum(n0,n4,a_select3(q,A,tptp_sum_index)) != n1 ),
inference(fof_nnf,status(thm),[c66]) ).
fof(c68,negated_conjecture,
? [X8] :
( leq(n0,X8)
& leq(X8,tptp_minus_1)
& sum(n0,n4,a_select3(q,X8,tptp_sum_index)) != n1 ),
inference(variable_rename,status(thm),[c67]) ).
fof(c69,negated_conjecture,
( leq(n0,skolem0001)
& leq(skolem0001,tptp_minus_1)
& sum(n0,n4,a_select3(q,skolem0001,tptp_sum_index)) != n1 ),
inference(skolemize,status(esa),[c68]) ).
cnf(c71,negated_conjecture,
leq(skolem0001,tptp_minus_1),
inference(split_conjunct,status(thm),[c69]) ).
fof(transitivity_leq,axiom,
! [X,Y,Z] :
( ( leq(X,Y)
& leq(Y,Z) )
=> leq(X,Z) ),
input ).
fof(c446,axiom,
! [X,Y,Z] :
( ~ leq(X,Y)
| ~ leq(Y,Z)
| leq(X,Z) ),
inference(fof_nnf,status(thm),[transitivity_leq]) ).
fof(c447,axiom,
! [X171,X172,X173] :
( ~ leq(X171,X172)
| ~ leq(X172,X173)
| leq(X171,X173) ),
inference(variable_rename,status(thm),[c446]) ).
cnf(c448,axiom,
( ~ leq(X2166,X2165)
| ~ leq(X2165,X2164)
| leq(X2166,X2164) ),
inference(split_conjunct,status(thm),[c447]) ).
cnf(c24568,plain,
( ~ leq(X2452,skolem0001)
| leq(X2452,tptp_minus_1) ),
inference(resolution,status(thm),[c448,c71]) ).
cnf(c70,negated_conjecture,
leq(n0,skolem0001),
inference(split_conjunct,status(thm),[c69]) ).
cnf(c24552,plain,
( ~ leq(X2433,n0)
| leq(X2433,skolem0001) ),
inference(resolution,status(thm),[c448,c70]) ).
cnf(symmetry,axiom,
( X185 != X184
| X184 = X185 ),
eq_axiom ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
input ).
cnf(c143,axiom,
succ(tptp_minus_1) = n0,
inference(split_conjunct,status(thm),[succ_tptp_minus_1]) ).
cnf(c486,plain,
n0 = succ(tptp_minus_1),
inference(resolution,status(thm),[c143,symmetry]) ).
cnf(reflexivity,axiom,
X181 = X181,
eq_axiom ).
fof(reflexivity_leq,axiom,
! [X] : leq(X,X),
input ).
fof(c449,axiom,
! [X174] : leq(X174,X174),
inference(variable_rename,status(thm),[reflexivity_leq]) ).
cnf(c450,axiom,
leq(X182,X182),
inference(split_conjunct,status(thm),[c449]) ).
cnf(c19,plain,
( X289 != X287
| X286 != X288
| ~ leq(X289,X286)
| leq(X287,X288) ),
eq_axiom ).
cnf(c672,plain,
( X2854 != X2853
| X2854 != X2852
| leq(X2853,X2852) ),
inference(resolution,status(thm),[c19,c450]) ).
cnf(c46921,plain,
( X2856 != X2855
| leq(X2855,X2856) ),
inference(resolution,status(thm),[c672,reflexivity]) ).
cnf(c46937,plain,
leq(succ(tptp_minus_1),n0),
inference(resolution,status(thm),[c46921,c486]) ).
cnf(c47216,plain,
leq(succ(tptp_minus_1),skolem0001),
inference(resolution,status(thm),[c46937,c24552]) ).
cnf(c48364,plain,
leq(succ(tptp_minus_1),tptp_minus_1),
inference(resolution,status(thm),[c47216,c24568]) ).
cnf(c49232,plain,
gt(tptp_minus_1,tptp_minus_1),
inference(resolution,status(thm),[c48364,c110]) ).
cnf(c49280,plain,
$false,
inference(resolution,status(thm),[c49232,c453]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV151+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n020.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 : 600
% 0.13/0.34 % DateTime : Wed Jun 15 10:55:04 EDT 2022
% 0.19/0.34 % CPUTime :
% 33.61/33.82 # Version: 1.3
% 33.61/33.82 # SZS status Theorem
% 33.61/33.82 # SZS output start CNFRefutation
% See solution above
% 33.61/33.82
% 33.61/33.82 # Initial clauses : 315
% 33.61/33.82 # Processed clauses : 1362
% 33.61/33.82 # Factors computed : 1
% 33.61/33.82 # Resolvents computed: 48821
% 33.61/33.82 # Tautologies deleted: 2
% 33.61/33.82 # Forward subsumed : 1091
% 33.61/33.82 # Backward subsumed : 0
% 33.61/33.82 # -------- CPU Time ---------
% 33.61/33.82 # User time : 33.295 s
% 33.61/33.82 # System time : 0.160 s
% 33.61/33.82 # Total time : 33.455 s
%------------------------------------------------------------------------------