TSTP Solution File: NUM893_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM893_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : 300s
% DateTime : Fri May 3 02:51:01 EDT 2024
% Result : Theorem 0.76s 0.99s
% Output : CNFRefutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 34 ( 33 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 40 ( 17 ~; 11 |; 8 &)
% ( 3 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 6 avg)
% Maximal term depth : 5 ( 2 avg)
% Number arithmetic : 71 ( 0 atm; 48 fun; 0 num; 23 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 0 usr; 0 con; 1-2 aty)
% Number of variables : 27 ( 0 sgn 14 !; 9 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1,conjecture,
? [X0: $int,X1: $int,X2: $int] :
( ( $sum(X0,X1) = X2 )
<=> ( ( $difference(X2,X0) = X1 )
& ( $difference(X2,X1) = X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_same_as_difference) ).
tff(f2,negated_conjecture,
~ ? [X0: $int,X1: $int,X2: $int] :
( ( $sum(X0,X1) = X2 )
<=> ( ( $difference(X2,X0) = X1 )
& ( $difference(X2,X1) = X0 ) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f3,plain,
~ ? [X0: $int,X1: $int,X2: $int] :
( ( $sum(X0,X1) = X2 )
<=> ( ( $sum(X2,$uminus(X0)) = X1 )
& ( $sum(X2,$uminus(X1)) = X0 ) ) ),
inference(theory_normalization,[],[f2]) ).
tff(f16,plain,
! [X0: $int,X1: $int,X2: $int] :
( ( $sum(X0,X1) = X2 )
<~> ( ( $sum(X2,$uminus(X0)) = X1 )
& ( $sum(X2,$uminus(X1)) = X0 ) ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f17,plain,
! [X0: $int,X1: $int,X2: $int] :
( ( ( $sum(X2,$uminus(X0)) != X1 )
| ( $sum(X2,$uminus(X1)) != X0 )
| ( $sum(X0,X1) != X2 ) )
& ( ( ( $sum(X2,$uminus(X0)) = X1 )
& ( $sum(X2,$uminus(X1)) = X0 ) )
| ( $sum(X0,X1) = X2 ) ) ),
inference(nnf_transformation,[],[f16]) ).
tff(f18,plain,
! [X0: $int,X1: $int,X2: $int] :
( ( ( $sum(X2,$uminus(X0)) != X1 )
| ( $sum(X2,$uminus(X1)) != X0 )
| ( $sum(X0,X1) != X2 ) )
& ( ( ( $sum(X2,$uminus(X0)) = X1 )
& ( $sum(X2,$uminus(X1)) = X0 ) )
| ( $sum(X0,X1) = X2 ) ) ),
inference(flattening,[],[f17]) ).
tff(f21,plain,
! [X2: $int,X0: $int,X1: $int] :
( ( $sum(X2,$uminus(X0)) != X1 )
| ( $sum(X2,$uminus(X1)) != X0 )
| ( $sum(X0,X1) != X2 ) ),
inference(cnf_transformation,[],[f18]) ).
tff(f22,plain,
! [X2: $int,X0: $int] :
( ( $sum(X2,$uminus($sum(X2,$uminus(X0)))) != X0 )
| ( $sum(X0,$sum(X2,$uminus(X0))) != X2 ) ),
inference(equality_resolution,[],[f21]) ).
cnf(c_61,negated_conjecture,
( $sum_int(X0_3,$uminus_int($sum_int(X0_3,$uminus_int(X1_3)))) != X1_3
| $sum_int(X1_3,$sum_int(X0_3,$uminus_int(X1_3))) != X0_3 ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_81,plain,
( $sum_int(X0_3,$uminus_int($sum_int(X0_3,$uminus_int(X1_3)))) != X1_3
| $sum_int(X1_3,$sum_int(X0_3,$uminus_int(X1_3))) != X0_3 ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
cnf(c_199,plain,
$false,
inference(smt_theory_normalisation,[status(thm)],[c_81]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : NUM893_1 : TPTP v8.1.2. Released v5.0.0.
% 0.02/0.08 % Command : run_iprover %s %d THM
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Thu May 2 19:48:08 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.11/0.35 Running TFA theorem proving
% 0.11/0.35 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
% 0.76/0.99 % SZS status Started for theBenchmark.p
% 0.76/0.99 % SZS status Theorem for theBenchmark.p
% 0.76/0.99
% 0.76/0.99 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.76/0.99
% 0.76/0.99 ------ iProver source info
% 0.76/0.99
% 0.76/0.99 git: date: 2024-05-02 19:28:25 +0000
% 0.76/0.99 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.76/0.99 git: non_committed_changes: false
% 0.76/0.99
% 0.76/0.99 ------ Parsing...
% 0.76/0.99 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.76/0.99
% 0.76/0.99 ------ Preprocessing...
% 0.76/0.99
% 0.76/0.99 % SZS status Theorem for theBenchmark.p
% 0.76/0.99
% 0.76/0.99 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.76/0.99
% 0.76/0.99
%------------------------------------------------------------------------------