TSTP Solution File: NUM395+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : NUM395+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n020.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:09:29 EDT 2022
% Result : Theorem 0.14s 0.39s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 16
% Syntax : Number of formulae : 30 ( 9 unt; 4 typ; 0 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 108 ( 53 ~; 20 |; 8 &)
% ( 27 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 2 ( 2 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 14 ( 12 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
tff(epsilon_connected_type,type,
epsilon_connected: $i > $o ).
tff(empty_set_type,type,
empty_set: $i ).
tff(epsilon_transitive_type,type,
epsilon_transitive: $i > $o ).
tff(ordinal_type,type,
ordinal: $i > $o ).
tff(1,plain,
( epsilon_connected(empty_set)
<=> epsilon_connected(empty_set) ),
inference(rewrite,[status(thm)],]) ).
tff(2,axiom,
( epsilon_transitive(empty_set)
& epsilon_connected(empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l18_ordinal1) ).
tff(3,plain,
epsilon_connected(empty_set),
inference(and_elim,[status(thm)],[2]) ).
tff(4,plain,
epsilon_connected(empty_set),
inference(modus_ponens,[status(thm)],[3,1]) ).
tff(5,plain,
( epsilon_transitive(empty_set)
<=> epsilon_transitive(empty_set) ),
inference(rewrite,[status(thm)],]) ).
tff(6,plain,
epsilon_transitive(empty_set),
inference(and_elim,[status(thm)],[2]) ).
tff(7,plain,
epsilon_transitive(empty_set),
inference(modus_ponens,[status(thm)],[6,5]) ).
tff(8,plain,
( ~ ( ~ epsilon_transitive(empty_set)
| ~ epsilon_connected(empty_set) )
| ~ epsilon_transitive(empty_set)
| ~ epsilon_connected(empty_set) ),
inference(tautology,[status(thm)],]) ).
tff(9,plain,
~ ( ~ epsilon_transitive(empty_set)
| ~ epsilon_connected(empty_set) ),
inference(unit_resolution,[status(thm)],[8,7,4]) ).
tff(10,plain,
( ~ ordinal(empty_set)
<=> ~ ordinal(empty_set) ),
inference(rewrite,[status(thm)],]) ).
tff(11,axiom,
~ ordinal(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t27_ordinal1) ).
tff(12,plain,
~ ordinal(empty_set),
inference(modus_ponens,[status(thm)],[11,10]) ).
tff(13,plain,
( ~ ( ordinal(empty_set)
<=> ~ ( ~ epsilon_transitive(empty_set)
| ~ epsilon_connected(empty_set) ) )
| ordinal(empty_set)
| ~ epsilon_transitive(empty_set)
| ~ epsilon_connected(empty_set) ),
inference(tautology,[status(thm)],]) ).
tff(14,plain,
~ ( ordinal(empty_set)
<=> ~ ( ~ epsilon_transitive(empty_set)
| ~ epsilon_connected(empty_set) ) ),
inference(unit_resolution,[status(thm)],[13,12,9]) ).
tff(15,plain,
^ [A: $i] :
refl(
( ( ordinal(A)
<=> ~ ( ~ epsilon_transitive(A)
| ~ epsilon_connected(A) ) )
<=> ( ordinal(A)
<=> ~ ( ~ epsilon_transitive(A)
| ~ epsilon_connected(A) ) ) )),
inference(bind,[status(th)],]) ).
tff(16,plain,
( ! [A: $i] :
( ordinal(A)
<=> ~ ( ~ epsilon_transitive(A)
| ~ epsilon_connected(A) ) )
<=> ! [A: $i] :
( ordinal(A)
<=> ~ ( ~ epsilon_transitive(A)
| ~ epsilon_connected(A) ) ) ),
inference(quant_intro,[status(thm)],[15]) ).
tff(17,plain,
^ [A: $i] :
rewrite(
( ( ordinal(A)
<=> ( epsilon_transitive(A)
& epsilon_connected(A) ) )
<=> ( ordinal(A)
<=> ~ ( ~ epsilon_transitive(A)
| ~ epsilon_connected(A) ) ) )),
inference(bind,[status(th)],]) ).
tff(18,plain,
( ! [A: $i] :
( ordinal(A)
<=> ( epsilon_transitive(A)
& epsilon_connected(A) ) )
<=> ! [A: $i] :
( ordinal(A)
<=> ~ ( ~ epsilon_transitive(A)
| ~ epsilon_connected(A) ) ) ),
inference(quant_intro,[status(thm)],[17]) ).
tff(19,plain,
( ! [A: $i] :
( ordinal(A)
<=> ( epsilon_transitive(A)
& epsilon_connected(A) ) )
<=> ! [A: $i] :
( ordinal(A)
<=> ( epsilon_transitive(A)
& epsilon_connected(A) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(20,axiom,
! [A: $i] :
( ordinal(A)
<=> ( epsilon_transitive(A)
& epsilon_connected(A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_ordinal1) ).
tff(21,plain,
! [A: $i] :
( ordinal(A)
<=> ( epsilon_transitive(A)
& epsilon_connected(A) ) ),
inference(modus_ponens,[status(thm)],[20,19]) ).
tff(22,plain,
! [A: $i] :
( ordinal(A)
<=> ( epsilon_transitive(A)
& epsilon_connected(A) ) ),
inference(skolemize,[status(sab)],[21]) ).
tff(23,plain,
! [A: $i] :
( ordinal(A)
<=> ~ ( ~ epsilon_transitive(A)
| ~ epsilon_connected(A) ) ),
inference(modus_ponens,[status(thm)],[22,18]) ).
tff(24,plain,
! [A: $i] :
( ordinal(A)
<=> ~ ( ~ epsilon_transitive(A)
| ~ epsilon_connected(A) ) ),
inference(modus_ponens,[status(thm)],[23,16]) ).
tff(25,plain,
( ~ ! [A: $i] :
( ordinal(A)
<=> ~ ( ~ epsilon_transitive(A)
| ~ epsilon_connected(A) ) )
| ( ordinal(empty_set)
<=> ~ ( ~ epsilon_transitive(empty_set)
| ~ epsilon_connected(empty_set) ) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(26,plain,
$false,
inference(unit_resolution,[status(thm)],[25,24,14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM395+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.33 % Computer : n020.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri Sep 2 10:11:59 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.34 Usage: tptp [options] [-file:]file
% 0.14/0.34 -h, -? prints this message.
% 0.14/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.14/0.34 -m, -model generate model.
% 0.14/0.34 -p, -proof generate proof.
% 0.14/0.34 -c, -core generate unsat core of named formulas.
% 0.14/0.34 -st, -statistics display statistics.
% 0.14/0.34 -t:timeout set timeout (in second).
% 0.14/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.14/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.34 -<param>:<value> configuration parameter and value.
% 0.14/0.34 -o:<output-file> file to place output in.
% 0.14/0.39 % SZS status Theorem
% 0.14/0.39 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------