TSTP Solution File: NUM025-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : NUM025-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n008.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 : Sun Sep 18 13:02:42 EDT 2022
% Result : Unsatisfiable 0.20s 0.39s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of formulae : 31 ( 12 unt; 3 typ; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 141 ( 71 ~; 57 |; 0 &)
% ( 13 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 8 ( 8 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 58 ( 54 !; 0 ?; 58 :)
% Comments :
%------------------------------------------------------------------------------
tff(less_type,type,
less: ( $i * $i ) > $o ).
tff(a_type,type,
a: $i ).
tff(b_type,type,
b: $i ).
tff(1,plain,
( less(b,a)
<=> less(b,a) ),
inference(rewrite,[status(thm)],]) ).
tff(2,axiom,
less(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_b_not_less_than_a) ).
tff(3,plain,
less(b,a),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
( less(a,b)
<=> less(a,b) ),
inference(rewrite,[status(thm)],]) ).
tff(5,axiom,
less(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_less_than_b) ).
tff(6,plain,
less(a,b),
inference(modus_ponens,[status(thm)],[5,4]) ).
tff(7,plain,
( ! [B: $i,A: $i,C: $i] :
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) )
<=> ! [B: $i,A: $i,C: $i] :
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) ) ),
inference(rewrite,[status(thm)],]) ).
tff(8,plain,
( ! [B: $i,A: $i,C: $i] :
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) )
<=> ! [B: $i,A: $i,C: $i] :
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) ) ),
inference(rewrite,[status(thm)],]) ).
tff(9,plain,
^ [B: $i,A: $i,C: $i] :
trans(
monotonicity(
rewrite(
( ( ~ less(A,B)
| ~ less(C,A) )
<=> ( ~ less(C,A)
| ~ less(A,B) ) )),
( ( ~ less(A,B)
| ~ less(C,A)
| less(C,B) )
<=> ( ~ less(C,A)
| ~ less(A,B)
| less(C,B) ) )),
rewrite(
( ( ~ less(C,A)
| ~ less(A,B)
| less(C,B) )
<=> ( less(C,B)
| ~ less(C,A)
| ~ less(A,B) ) )),
( ( ~ less(A,B)
| ~ less(C,A)
| less(C,B) )
<=> ( less(C,B)
| ~ less(C,A)
| ~ less(A,B) ) )),
inference(bind,[status(th)],]) ).
tff(10,plain,
( ! [B: $i,A: $i,C: $i] :
( ~ less(A,B)
| ~ less(C,A)
| less(C,B) )
<=> ! [B: $i,A: $i,C: $i] :
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) ) ),
inference(quant_intro,[status(thm)],[9]) ).
tff(11,axiom,
! [B: $i,A: $i,C: $i] :
( ~ less(A,B)
| ~ less(C,A)
| less(C,B) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM001-1.ax',transitivity_of_less) ).
tff(12,plain,
! [B: $i,A: $i,C: $i] :
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) ),
inference(modus_ponens,[status(thm)],[11,10]) ).
tff(13,plain,
! [B: $i,A: $i,C: $i] :
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) ),
inference(modus_ponens,[status(thm)],[12,8]) ).
tff(14,plain,
! [B: $i,A: $i,C: $i] :
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) ),
inference(skolemize,[status(sab)],[13]) ).
tff(15,plain,
! [B: $i,A: $i,C: $i] :
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) ),
inference(modus_ponens,[status(thm)],[14,7]) ).
tff(16,plain,
( ( ~ ! [B: $i,A: $i,C: $i] :
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) )
| less(a,a)
| ~ less(a,b)
| ~ less(b,a) )
<=> ( ~ ! [B: $i,A: $i,C: $i] :
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) )
| less(a,a)
| ~ less(a,b)
| ~ less(b,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(17,plain,
( ~ ! [B: $i,A: $i,C: $i] :
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) )
| less(a,a)
| ~ less(a,b)
| ~ less(b,a) ),
inference(quant_inst,[status(thm)],]) ).
tff(18,plain,
( ~ ! [B: $i,A: $i,C: $i] :
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) )
| less(a,a)
| ~ less(a,b)
| ~ less(b,a) ),
inference(modus_ponens,[status(thm)],[17,16]) ).
tff(19,plain,
less(a,a),
inference(unit_resolution,[status(thm)],[18,15,6,3]) ).
tff(20,plain,
^ [A: $i] :
refl(
( ~ less(A,A)
<=> ~ less(A,A) )),
inference(bind,[status(th)],]) ).
tff(21,plain,
( ! [A: $i] : ~ less(A,A)
<=> ! [A: $i] : ~ less(A,A) ),
inference(quant_intro,[status(thm)],[20]) ).
tff(22,plain,
( ! [A: $i] : ~ less(A,A)
<=> ! [A: $i] : ~ less(A,A) ),
inference(rewrite,[status(thm)],]) ).
tff(23,axiom,
! [A: $i] : ~ less(A,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_number_less_than_itself) ).
tff(24,plain,
! [A: $i] : ~ less(A,A),
inference(modus_ponens,[status(thm)],[23,22]) ).
tff(25,plain,
! [A: $i] : ~ less(A,A),
inference(skolemize,[status(sab)],[24]) ).
tff(26,plain,
! [A: $i] : ~ less(A,A),
inference(modus_ponens,[status(thm)],[25,21]) ).
tff(27,plain,
( ~ ! [A: $i] : ~ less(A,A)
| ~ less(a,a) ),
inference(quant_inst,[status(thm)],]) ).
tff(28,plain,
$false,
inference(unit_resolution,[status(thm)],[27,26,19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM025-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Sep 2 06:34:55 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.20/0.39 % SZS status Unsatisfiable
% 0.20/0.39 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------