TSTP Solution File: SWV139+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV139+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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 : Fri May 3 03:13:35 EDT 2024
% Result : Theorem 4.23s 1.10s
% Output : CNFRefutation 4.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 11 unt; 0 def)
% Number of atoms : 166 ( 9 equ)
% Maximal formula atoms : 27 ( 5 avg)
% Number of connectives : 183 ( 50 ~; 49 |; 56 &)
% ( 0 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 27 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1,X2] :
( ( gt(X1,X2)
& gt(X0,X1) )
=> gt(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_gt) ).
fof(f9,axiom,
! [X0,X1] :
( ( X0 != X1
& leq(X0,X1) )
=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_gt2) ).
fof(f53,conjecture,
( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) )
=> leq(n0,s_best7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0009) ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) )
=> leq(n0,s_best7) ),
inference(negated_conjecture,[],[f53]) ).
fof(f64,axiom,
gt(n1,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_1_0) ).
fof(f108,plain,
! [X0,X1,X2] :
( gt(X0,X2)
| ~ gt(X1,X2)
| ~ gt(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f109,plain,
! [X0,X1,X2] :
( gt(X0,X2)
| ~ gt(X1,X2)
| ~ gt(X0,X1) ),
inference(flattening,[],[f108]) ).
fof(f113,plain,
! [X0,X1] :
( gt(X1,X0)
| X0 = X1
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f114,plain,
! [X0,X1] :
( gt(X1,X0)
| X0 = X1
| ~ leq(X0,X1) ),
inference(flattening,[],[f113]) ).
fof(f148,plain,
( ~ leq(n0,s_best7)
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) ),
inference(ennf_transformation,[],[f54]) ).
fof(f149,plain,
( ~ leq(n0,s_best7)
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) ),
inference(flattening,[],[f148]) ).
fof(f217,plain,
! [X2,X0,X1] :
( gt(X0,X2)
| ~ gt(X1,X2)
| ~ gt(X0,X1) ),
inference(cnf_transformation,[],[f109]) ).
fof(f222,plain,
! [X0,X1] :
( gt(X1,X0)
| X0 = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
fof(f327,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[],[f149]) ).
fof(f334,plain,
( leq(n0,s_best7)
| ~ gt(loopcounter,n0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f338,plain,
( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f340,plain,
~ leq(n0,s_best7),
inference(cnf_transformation,[],[f149]) ).
fof(f350,plain,
gt(n1,n0),
inference(cnf_transformation,[],[f64]) ).
cnf(c_50,plain,
( ~ gt(X0,X1)
| ~ gt(X1,X2)
| gt(X0,X2) ),
inference(cnf_transformation,[],[f217]) ).
cnf(c_55,plain,
( ~ leq(X0,X1)
| X0 = X1
| gt(X1,X0) ),
inference(cnf_transformation,[],[f222]) ).
cnf(c_157,negated_conjecture,
~ leq(n0,s_best7),
inference(cnf_transformation,[],[f340]) ).
cnf(c_159,negated_conjecture,
( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) ),
inference(cnf_transformation,[],[f338]) ).
cnf(c_163,negated_conjecture,
( ~ gt(loopcounter,n0)
| leq(n0,s_best7) ),
inference(cnf_transformation,[],[f334]) ).
cnf(c_170,negated_conjecture,
leq(n1,loopcounter),
inference(cnf_transformation,[],[f327]) ).
cnf(c_181,plain,
gt(n1,n0),
inference(cnf_transformation,[],[f350]) ).
cnf(c_314,negated_conjecture,
~ gt(loopcounter,n0),
inference(global_subsumption_just,[status(thm)],[c_159,c_157,c_163]) ).
cnf(c_14071,plain,
( n1 = loopcounter
| gt(loopcounter,n1) ),
inference(superposition,[status(thm)],[c_170,c_55]) ).
cnf(c_14091,plain,
( ~ gt(X0,n1)
| gt(X0,n0) ),
inference(superposition,[status(thm)],[c_181,c_50]) ).
cnf(c_14163,plain,
( ~ gt(X0,loopcounter)
| n1 = loopcounter
| gt(X0,n1) ),
inference(superposition,[status(thm)],[c_14071,c_50]) ).
cnf(c_14203,plain,
( n1 = loopcounter
| gt(loopcounter,n0) ),
inference(superposition,[status(thm)],[c_14071,c_14091]) ).
cnf(c_14350,plain,
n1 = loopcounter,
inference(global_subsumption_just,[status(thm)],[c_14163,c_157,c_163,c_14203]) ).
cnf(c_14354,plain,
~ gt(n1,n0),
inference(superposition,[status(thm)],[c_14350,c_314]) ).
cnf(c_14356,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_181,c_14354]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWV139+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n004.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 00:19:33 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.23/1.10 % SZS status Started for theBenchmark.p
% 4.23/1.10 % SZS status Theorem for theBenchmark.p
% 4.23/1.10
% 4.23/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.23/1.10
% 4.23/1.10 ------ iProver source info
% 4.23/1.10
% 4.23/1.10 git: date: 2024-05-02 19:28:25 +0000
% 4.23/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.23/1.10 git: non_committed_changes: false
% 4.23/1.10
% 4.23/1.10 ------ Parsing...
% 4.23/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.23/1.10
% 4.23/1.10 ------ Preprocessing... sup_sim: 17 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 4.23/1.10
% 4.23/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.23/1.10
% 4.23/1.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.23/1.10 ------ Proving...
% 4.23/1.10 ------ Problem Properties
% 4.23/1.10
% 4.23/1.10
% 4.23/1.10 clauses 144
% 4.23/1.10 conjectures 4
% 4.23/1.10 EPR 40
% 4.23/1.10 Horn 94
% 4.23/1.10 unary 50
% 4.23/1.10 binary 34
% 4.23/1.10 lits 483
% 4.23/1.10 lits eq 113
% 4.23/1.10 fd_pure 0
% 4.23/1.10 fd_pseudo 0
% 4.23/1.10 fd_cond 6
% 4.23/1.10 fd_pseudo_cond 4
% 4.23/1.10 AC symbols 0
% 4.23/1.10
% 4.23/1.10 ------ Input Options Time Limit: Unbounded
% 4.23/1.10
% 4.23/1.10
% 4.23/1.10 ------
% 4.23/1.10 Current options:
% 4.23/1.10 ------
% 4.23/1.10
% 4.23/1.10
% 4.23/1.10
% 4.23/1.10
% 4.23/1.10 ------ Proving...
% 4.23/1.10
% 4.23/1.10
% 4.23/1.10 % SZS status Theorem for theBenchmark.p
% 4.23/1.10
% 4.23/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.23/1.10
% 4.23/1.10
%------------------------------------------------------------------------------