TSTP Solution File: SWV139+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWV139+1 : TPTP v8.1.0. Bugfixed v3.3.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 : 600s
% DateTime : Wed Jul 20 21:15:57 EDT 2022
% Result : Theorem 39.85s 40.07s
% Output : Refutation 39.85s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named eq_axiom)
% Comments :
%------------------------------------------------------------------------------
fof(gauss_array_0009,conjecture,
( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(n0,s_best7) ),
input ).
fof(c66,negated_conjecture,
~ ( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(n0,s_best7) ),
inference(assume_negation,status(cth),[gauss_array_0009]) ).
fof(c67,negated_conjecture,
~ ( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(n0,s_best7) ),
inference(fof_simplification,status(thm),[c66]) ).
fof(c68,negated_conjecture,
( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_worst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_sworst7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_best7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_worst7) )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_worst7,n3) )
& ~ leq(n0,s_best7) ),
inference(fof_nnf,status(thm),[c67]) ).
cnf(c83,negated_conjecture,
~ leq(n0,s_best7),
inference(split_conjunct,status(thm),[c68]) ).
cnf(c77,negated_conjecture,
( ~ gt(loopcounter,n0)
| leq(n0,s_best7) ),
inference(split_conjunct,status(thm),[c68]) ).
fof(leq_succ_gt,axiom,
! [X,Y] :
( leq(succ(X),Y)
=> gt(Y,X) ),
input ).
fof(c119,axiom,
! [X,Y] :
( ~ leq(succ(X),Y)
| gt(Y,X) ),
inference(fof_nnf,status(thm),[leq_succ_gt]) ).
fof(c120,axiom,
! [X42,X43] :
( ~ leq(succ(X42),X43)
| gt(X43,X42) ),
inference(variable_rename,status(thm),[c119]) ).
cnf(c121,axiom,
( ~ leq(succ(X317),X316)
| gt(X316,X317) ),
inference(split_conjunct,status(thm),[c120]) ).
cnf(c70,negated_conjecture,
leq(n1,loopcounter),
inference(split_conjunct,status(thm),[c68]) ).
fof(transitivity_leq,axiom,
! [X,Y,Z] :
( ( leq(X,Y)
& leq(Y,Z) )
=> leq(X,Z) ),
input ).
fof(c457,axiom,
! [X,Y,Z] :
( ~ leq(X,Y)
| ~ leq(Y,Z)
| leq(X,Z) ),
inference(fof_nnf,status(thm),[transitivity_leq]) ).
fof(c458,axiom,
! [X170,X171,X172] :
( ~ leq(X170,X171)
| ~ leq(X171,X172)
| leq(X170,X172) ),
inference(variable_rename,status(thm),[c457]) ).
cnf(c459,axiom,
( ~ leq(X2088,X2087)
| ~ leq(X2087,X2089)
| leq(X2088,X2089) ),
inference(split_conjunct,status(thm),[c458]) ).
cnf(c22735,plain,
( ~ leq(X2193,n1)
| leq(X2193,loopcounter) ),
inference(resolution,status(thm),[c459,c70]) ).
cnf(symmetry,axiom,
( X184 != X183
| X183 = X184 ),
eq_axiom ).
fof(successor_1,axiom,
succ(n0) = n1,
input ).
cnf(c24,axiom,
succ(n0) = n1,
inference(split_conjunct,status(thm),[successor_1]) ).
cnf(c477,plain,
n1 = succ(n0),
inference(resolution,status(thm),[c24,symmetry]) ).
cnf(reflexivity,axiom,
X180 = X180,
eq_axiom ).
fof(reflexivity_leq,axiom,
! [X] : leq(X,X),
input ).
fof(c460,axiom,
! [X173] : leq(X173,X173),
inference(variable_rename,status(thm),[reflexivity_leq]) ).
cnf(c461,axiom,
leq(X181,X181),
inference(split_conjunct,status(thm),[c460]) ).
cnf(c19,plain,
( X286 != X285
| X284 != X283
| ~ leq(X286,X284)
| leq(X285,X283) ),
eq_axiom ).
cnf(c683,plain,
( X2779 != X2778
| X2779 != X2780
| leq(X2778,X2780) ),
inference(resolution,status(thm),[c19,c461]) ).
cnf(c51313,plain,
( X2781 != X2782
| leq(X2782,X2781) ),
inference(resolution,status(thm),[c683,reflexivity]) ).
cnf(c51383,plain,
leq(succ(n0),n1),
inference(resolution,status(thm),[c51313,c477]) ).
cnf(c52051,plain,
leq(succ(n0),loopcounter),
inference(resolution,status(thm),[c51383,c22735]) ).
cnf(c52724,plain,
gt(loopcounter,n0),
inference(resolution,status(thm),[c52051,c121]) ).
cnf(c52813,plain,
leq(n0,s_best7),
inference(resolution,status(thm),[c52724,c77]) ).
cnf(c52878,plain,
$false,
inference(resolution,status(thm),[c52813,c83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : SWV139+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.04/0.11 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Wed Jun 15 20:10:44 EDT 2022
% 0.11/0.31 % CPUTime :
% 39.85/40.07 # Version: 1.3
% 39.85/40.07 # SZS status Theorem
% 39.85/40.07 # SZS output start CNFRefutation
% See solution above
% 39.85/40.07
% 39.85/40.07 # Initial clauses : 327
% 39.85/40.07 # Processed clauses : 1419
% 39.85/40.07 # Factors computed : 1
% 39.85/40.07 # Resolvents computed: 52494
% 39.85/40.07 # Tautologies deleted: 2
% 39.85/40.07 # Forward subsumed : 1063
% 39.85/40.07 # Backward subsumed : 1
% 39.85/40.07 # -------- CPU Time ---------
% 39.85/40.07 # User time : 39.560 s
% 39.85/40.07 # System time : 0.195 s
% 39.85/40.07 # Total time : 39.755 s
%------------------------------------------------------------------------------