TSTP Solution File: ARI632_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ARI632_1 : TPTP v8.1.2. Released v6.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : Fri May 3 02:07:25 EDT 2024
% Result : Theorem 7.89s 1.61s
% Output : CNFRefutation 7.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 81 ( 8 equ)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 25 ( 13 ~; 10 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of FOOLs : 42 ( 42 fml; 0 var)
% Number arithmetic : 48 ( 19 atm; 14 fun; 0 num; 15 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 2 ( 0 usr; 0 con; 2-2 aty)
% Number of variables : 26 ( 0 sgn 15 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1,axiom,
! [X0: $real,X1: $real] :
( $greatereq(X0,X1)
=> $greatereq(f(X0),f(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f_non_decreasing) ).
tff(f2,axiom,
$less(u,v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hypothesis) ).
tff(f3,axiom,
$lesseq(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hypothesis_01) ).
tff(f4,conjecture,
$less($sum(u,f(x)),$sum(v,f(y))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conclusion) ).
tff(f5,negated_conjecture,
~ $less($sum(u,f(x)),$sum(v,f(y))),
inference(negated_conjecture,[],[f4]) ).
tff(f6,plain,
! [X0: $real,X1: $real] :
( ~ $less(X0,X1)
=> ~ $less(f(X0),f(X1)) ),
inference(theory_normalization,[],[f1]) ).
tff(f7,plain,
~ $less(y,x),
inference(theory_normalization,[],[f3]) ).
tff(f8,plain,
! [X0: $real,X1: $real] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_138,[]) ).
tff(f9,plain,
! [X2: $real,X0: $real,X1: $real] : ( $sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2) ),
introduced(theory_axiom_139,[]) ).
tff(f15,plain,
! [X0: $real,X1: $real] :
( $less(X0,X1)
| $less(X1,X0)
| ( X0 = X1 ) ),
introduced(theory_axiom_147,[]) ).
tff(f19,plain,
~ $less($sum(u,f(x)),$sum(v,f(y))),
inference(flattening,[],[f5]) ).
tff(f20,plain,
! [X0: $real,X1: $real] :
( ~ $less(f(X0),f(X1))
| $less(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
tff(f21,plain,
! [X0: $real,X1: $real] :
( ~ $less(f(X0),f(X1))
| $less(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
tff(f22,plain,
$less(u,v),
inference(cnf_transformation,[],[f2]) ).
tff(f23,plain,
~ $less(y,x),
inference(cnf_transformation,[],[f7]) ).
tff(f24,plain,
~ $less($sum(u,f(x)),$sum(v,f(y))),
inference(cnf_transformation,[],[f19]) ).
cnf(c_52,negated_conjecture,
( X0_2 = X1_2
| $less_real(X0_2,X1_2)
| $less_real(X1_2,X0_2) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_58,negated_conjecture,
$sum_real($sum_real(X0_2,X1_2),X2_2) = $sum_real(X0_2,$sum_real(X1_2,X2_2)),
inference(cnf_transformation,[],[f9]) ).
cnf(c_59,negated_conjecture,
$sum_real(X0_2,X1_2) = $sum_real(X1_2,X0_2),
inference(cnf_transformation,[],[f8]) ).
cnf(c_60,plain,
( ~ $less_real(f(X0_2),f(X1_2))
| $less_real(X0_2,X1_2) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_61,negated_conjecture,
$less_real(u,v),
inference(cnf_transformation,[],[f22]) ).
cnf(c_62,negated_conjecture,
~ $less_real(y,x),
inference(cnf_transformation,[],[f23]) ).
cnf(c_63,negated_conjecture,
~ $less_real($sum_real(u,f(x)),$sum_real(v,f(y))),
inference(cnf_transformation,[],[f24]) ).
cnf(c_75,negated_conjecture,
~ $less_real($sum_real(f(x),u),$sum_real(f(y),v)),
inference(theory_normalisation,[status(thm)],[c_63,c_58,c_59]) ).
cnf(c_842,plain,
( f(X0_2) = f(X1_2)
| $less_real(f(X0_2),f(X1_2))
| $less_real(X1_2,X0_2) ),
inference(superposition,[status(thm)],[c_52,c_60]) ).
cnf(c_7637,plain,
( f(x) = f(y)
| $less_real(f(x),f(y)) ),
inference(superposition,[status(thm)],[c_842,c_62]) ).
cnf(c_10823,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_7637,c_75,c_61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : ARI632_1 : TPTP v8.1.2. Released v6.3.0.
% 0.08/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n005.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.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 00:58:26 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.42 Running TFA theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa --heuristic_context casc_unsat /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.89/1.61 % SZS status Started for theBenchmark.p
% 7.89/1.61 % SZS status Theorem for theBenchmark.p
% 7.89/1.61
% 7.89/1.61 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.89/1.61
% 7.89/1.61 ------ iProver source info
% 7.89/1.61
% 7.89/1.61 git: date: 2024-05-02 19:28:25 +0000
% 7.89/1.61 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.89/1.61 git: non_committed_changes: false
% 7.89/1.61
% 7.89/1.61 ------ Parsing...
% 7.89/1.61 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.89/1.61
% 7.89/1.61 ------ Preprocessing... sup_sim: 1 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
% 7.89/1.61
% 7.89/1.61 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.89/1.61
% 7.89/1.61 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.89/1.61 ------ Proving...
% 7.89/1.61 ------ Problem Properties
% 7.89/1.61
% 7.89/1.61
% 7.89/1.61 clauses 15
% 7.89/1.61 conjectures 12
% 7.89/1.61 EPR 6
% 7.89/1.61 Horn 13
% 7.89/1.61 unary 11
% 7.89/1.61 binary 2
% 7.89/1.61 lits 21
% 7.89/1.61 lits eq 7
% 7.89/1.61 fd_pure 0
% 7.89/1.61 fd_pseudo 0
% 7.89/1.61 fd_cond 0
% 7.89/1.61 fd_pseudo_cond 1
% 7.89/1.61 AC symbols 1
% 7.89/1.61
% 7.89/1.61 ------ Input Options Time Limit: Unbounded
% 7.89/1.61
% 7.89/1.61
% 7.89/1.61 ------
% 7.89/1.61 Current options:
% 7.89/1.61 ------
% 7.89/1.61
% 7.89/1.61
% 7.89/1.61
% 7.89/1.61
% 7.89/1.61 ------ Proving...
% 7.89/1.61
% 7.89/1.61
% 7.89/1.61 % SZS status Theorem for theBenchmark.p
% 7.89/1.61
% 7.89/1.61 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.89/1.61
% 7.89/1.61
%------------------------------------------------------------------------------