TSTP Solution File: KRS091+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : KRS091+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n015.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 : Sat Sep 17 17:44:42 EDT 2022
% Result : Unsatisfiable 0.21s 0.38s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 20
% Syntax : Number of formulae : 40 ( 9 unt; 4 typ; 0 def)
% Number of atoms : 130 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 193 ( 103 ~; 48 |; 7 &)
% ( 32 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 4 ( 4 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 : 31 ( 27 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
tff(cc_type,type,
cc: $i > $o ).
tff(i2003_11_14_17_20_00819_type,type,
i2003_11_14_17_20_00819: $i ).
tff(cd_type,type,
cd: $i > $o ).
tff(cUnsatisfiable_type,type,
cUnsatisfiable: $i > $o ).
tff(1,plain,
^ [X: $i] :
refl(
( ( cUnsatisfiable(X)
<=> ~ ( ~ cd(X)
| ~ cc(X) ) )
<=> ( cUnsatisfiable(X)
<=> ~ ( ~ cd(X)
| ~ cc(X) ) ) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [X: $i] :
( cUnsatisfiable(X)
<=> ~ ( ~ cd(X)
| ~ cc(X) ) )
<=> ! [X: $i] :
( cUnsatisfiable(X)
<=> ~ ( ~ cd(X)
| ~ cc(X) ) ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
^ [X: $i] :
rewrite(
( ( cUnsatisfiable(X)
<=> ( cd(X)
& cc(X) ) )
<=> ( cUnsatisfiable(X)
<=> ~ ( ~ cd(X)
| ~ cc(X) ) ) )),
inference(bind,[status(th)],]) ).
tff(4,plain,
( ! [X: $i] :
( cUnsatisfiable(X)
<=> ( cd(X)
& cc(X) ) )
<=> ! [X: $i] :
( cUnsatisfiable(X)
<=> ~ ( ~ cd(X)
| ~ cc(X) ) ) ),
inference(quant_intro,[status(thm)],[3]) ).
tff(5,plain,
( ! [X: $i] :
( cUnsatisfiable(X)
<=> ( cd(X)
& cc(X) ) )
<=> ! [X: $i] :
( cUnsatisfiable(X)
<=> ( cd(X)
& cc(X) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(6,axiom,
! [X: $i] :
( cUnsatisfiable(X)
<=> ( cd(X)
& cc(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(7,plain,
! [X: $i] :
( cUnsatisfiable(X)
<=> ( cd(X)
& cc(X) ) ),
inference(modus_ponens,[status(thm)],[6,5]) ).
tff(8,plain,
! [X: $i] :
( cUnsatisfiable(X)
<=> ( cd(X)
& cc(X) ) ),
inference(skolemize,[status(sab)],[7]) ).
tff(9,plain,
! [X: $i] :
( cUnsatisfiable(X)
<=> ~ ( ~ cd(X)
| ~ cc(X) ) ),
inference(modus_ponens,[status(thm)],[8,4]) ).
tff(10,plain,
! [X: $i] :
( cUnsatisfiable(X)
<=> ~ ( ~ cd(X)
| ~ cc(X) ) ),
inference(modus_ponens,[status(thm)],[9,2]) ).
tff(11,plain,
( ~ ! [X: $i] :
( cUnsatisfiable(X)
<=> ~ ( ~ cd(X)
| ~ cc(X) ) )
| ( cUnsatisfiable(i2003_11_14_17_20_00819)
<=> ~ ( ~ cd(i2003_11_14_17_20_00819)
| ~ cc(i2003_11_14_17_20_00819) ) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(12,plain,
( cUnsatisfiable(i2003_11_14_17_20_00819)
<=> ~ ( ~ cd(i2003_11_14_17_20_00819)
| ~ cc(i2003_11_14_17_20_00819) ) ),
inference(unit_resolution,[status(thm)],[11,10]) ).
tff(13,plain,
( cUnsatisfiable(i2003_11_14_17_20_00819)
<=> cUnsatisfiable(i2003_11_14_17_20_00819) ),
inference(rewrite,[status(thm)],]) ).
tff(14,axiom,
cUnsatisfiable(i2003_11_14_17_20_00819),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
tff(15,plain,
cUnsatisfiable(i2003_11_14_17_20_00819),
inference(modus_ponens,[status(thm)],[14,13]) ).
tff(16,plain,
( ~ ( cUnsatisfiable(i2003_11_14_17_20_00819)
<=> ~ ( ~ cd(i2003_11_14_17_20_00819)
| ~ cc(i2003_11_14_17_20_00819) ) )
| ~ cUnsatisfiable(i2003_11_14_17_20_00819)
| ~ ( ~ cd(i2003_11_14_17_20_00819)
| ~ cc(i2003_11_14_17_20_00819) ) ),
inference(tautology,[status(thm)],]) ).
tff(17,plain,
( ~ ( cUnsatisfiable(i2003_11_14_17_20_00819)
<=> ~ ( ~ cd(i2003_11_14_17_20_00819)
| ~ cc(i2003_11_14_17_20_00819) ) )
| ~ ( ~ cd(i2003_11_14_17_20_00819)
| ~ cc(i2003_11_14_17_20_00819) ) ),
inference(unit_resolution,[status(thm)],[16,15]) ).
tff(18,plain,
~ ( ~ cd(i2003_11_14_17_20_00819)
| ~ cc(i2003_11_14_17_20_00819) ),
inference(unit_resolution,[status(thm)],[17,12]) ).
tff(19,plain,
( ~ cd(i2003_11_14_17_20_00819)
| ~ cc(i2003_11_14_17_20_00819)
| cc(i2003_11_14_17_20_00819) ),
inference(tautology,[status(thm)],]) ).
tff(20,plain,
cc(i2003_11_14_17_20_00819),
inference(unit_resolution,[status(thm)],[19,18]) ).
tff(21,plain,
( ~ cd(i2003_11_14_17_20_00819)
| ~ cc(i2003_11_14_17_20_00819)
| cd(i2003_11_14_17_20_00819) ),
inference(tautology,[status(thm)],]) ).
tff(22,plain,
cd(i2003_11_14_17_20_00819),
inference(unit_resolution,[status(thm)],[21,18]) ).
tff(23,plain,
^ [X: $i] :
refl(
( ( ~ cc(X)
| ~ cd(X) )
<=> ( ~ cc(X)
| ~ cd(X) ) )),
inference(bind,[status(th)],]) ).
tff(24,plain,
( ! [X: $i] :
( ~ cc(X)
| ~ cd(X) )
<=> ! [X: $i] :
( ~ cc(X)
| ~ cd(X) ) ),
inference(quant_intro,[status(thm)],[23]) ).
tff(25,plain,
( ! [X: $i] :
( ~ cc(X)
| ~ cd(X) )
<=> ! [X: $i] :
( ~ cc(X)
| ~ cd(X) ) ),
inference(rewrite,[status(thm)],]) ).
tff(26,plain,
^ [X: $i] :
rewrite(
( ( cc(X)
=> ~ cd(X) )
<=> ( ~ cc(X)
| ~ cd(X) ) )),
inference(bind,[status(th)],]) ).
tff(27,plain,
( ! [X: $i] :
( cc(X)
=> ~ cd(X) )
<=> ! [X: $i] :
( ~ cc(X)
| ~ cd(X) ) ),
inference(quant_intro,[status(thm)],[26]) ).
tff(28,axiom,
! [X: $i] :
( cc(X)
=> ~ cd(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
tff(29,plain,
! [X: $i] :
( ~ cc(X)
| ~ cd(X) ),
inference(modus_ponens,[status(thm)],[28,27]) ).
tff(30,plain,
! [X: $i] :
( ~ cc(X)
| ~ cd(X) ),
inference(modus_ponens,[status(thm)],[29,25]) ).
tff(31,plain,
! [X: $i] :
( ~ cc(X)
| ~ cd(X) ),
inference(skolemize,[status(sab)],[30]) ).
tff(32,plain,
! [X: $i] :
( ~ cc(X)
| ~ cd(X) ),
inference(modus_ponens,[status(thm)],[31,24]) ).
tff(33,plain,
( ( ~ ! [X: $i] :
( ~ cc(X)
| ~ cd(X) )
| ~ cc(i2003_11_14_17_20_00819)
| ~ cd(i2003_11_14_17_20_00819) )
<=> ( ~ ! [X: $i] :
( ~ cc(X)
| ~ cd(X) )
| ~ cc(i2003_11_14_17_20_00819)
| ~ cd(i2003_11_14_17_20_00819) ) ),
inference(rewrite,[status(thm)],]) ).
tff(34,plain,
( ~ ! [X: $i] :
( ~ cc(X)
| ~ cd(X) )
| ~ cc(i2003_11_14_17_20_00819)
| ~ cd(i2003_11_14_17_20_00819) ),
inference(quant_inst,[status(thm)],]) ).
tff(35,plain,
( ~ ! [X: $i] :
( ~ cc(X)
| ~ cd(X) )
| ~ cc(i2003_11_14_17_20_00819)
| ~ cd(i2003_11_14_17_20_00819) ),
inference(modus_ponens,[status(thm)],[34,33]) ).
tff(36,plain,
$false,
inference(unit_resolution,[status(thm)],[35,32,22,20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS091+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.33 % Computer : n015.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.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Sep 1 09:43:53 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.21/0.38 % SZS status Unsatisfiable
% 0.21/0.38 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------