TSTP Solution File: ARI653_1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : ARI653_1 : TPTP v8.1.0. Released v6.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n014.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 : Tue Sep 6 17:02:28 EDT 2022
% Result : Unsatisfiable 0.13s 0.39s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of formulae : 13 ( 7 unt; 1 typ; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 2 ~; 1 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 40 ( 16 atm; 4 fun; 20 num; 0 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 1 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(a_type,type,
a: $int ).
tff(1,plain,
( $greatereq(a,1)
<=> $greatereq(a,1) ),
inference(rewrite,[status(thm)],]) ).
tff(2,plain,
( $lesseq(1,$product(5,a))
<=> $greatereq(a,1) ),
inference(rewrite,[status(thm)],]) ).
tff(3,axiom,
$lesseq(1,$product(5,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_001) ).
tff(4,plain,
$greatereq(a,1),
inference(modus_ponens,[status(thm)],[3,2]) ).
tff(5,plain,
$greatereq(a,1),
inference(modus_ponens,[status(thm)],[4,1]) ).
tff(6,plain,
( $lesseq(a,0)
<=> $lesseq(a,0) ),
inference(rewrite,[status(thm)],]) ).
tff(7,plain,
( $greatereq(6,$product(7,a))
<=> $lesseq(a,0) ),
inference(rewrite,[status(thm)],]) ).
tff(8,axiom,
$greatereq(6,$product(7,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(9,plain,
$lesseq(a,0),
inference(modus_ponens,[status(thm)],[8,7]) ).
tff(10,plain,
$lesseq(a,0),
inference(modus_ponens,[status(thm)],[9,6]) ).
tff(11,plain,
( ~ $lesseq(a,0)
| ~ $greatereq(a,1) ),
inference(theory_lemma,[status(thm)],]) ).
tff(12,plain,
$false,
inference(unit_resolution,[status(thm)],[11,10,5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI653_1 : TPTP v8.1.0. Released v6.3.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n014.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 : 300
% 0.13/0.34 % DateTime : Tue Aug 30 01:20:33 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.35 Usage: tptp [options] [-file:]file
% 0.13/0.35 -h, -? prints this message.
% 0.13/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.35 -m, -model generate model.
% 0.13/0.35 -p, -proof generate proof.
% 0.13/0.35 -c, -core generate unsat core of named formulas.
% 0.13/0.35 -st, -statistics display statistics.
% 0.13/0.35 -t:timeout set timeout (in second).
% 0.13/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.35 -<param>:<value> configuration parameter and value.
% 0.13/0.35 -o:<output-file> file to place output in.
% 0.13/0.39 % SZS status Unsatisfiable
% 0.13/0.39 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------