TSTP Solution File: SET838-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SET838-1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n016.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 20 05:08:15 EDT 2022
% Result : Unsatisfiable 0.44s 0.61s
% Output : Proof 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 23
% Syntax : Number of formulae : 54 ( 16 unt; 4 typ; 0 def)
% Number of atoms : 150 ( 144 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 193 ( 98 ~; 78 |; 0 &)
% ( 17 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of FOOLs : 5 ( 5 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 47 ( 42 !; 0 ?; 47 :)
% Comments :
%------------------------------------------------------------------------------
tff(v_g_type,type,
v_g: $i > $i ).
tff(v_x_type,type,
v_x: $i ).
tff(v_xa_type,type,
v_xa: $i > $i ).
tff(v_f_type,type,
v_f: $i > $i ).
tff(1,plain,
( ( v_f(v_g(v_x)) = v_x )
<=> ( v_f(v_g(v_x)) = v_x ) ),
inference(rewrite,[status(thm)],]) ).
tff(2,axiom,
v_f(v_g(v_x)) = v_x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
tff(3,plain,
v_f(v_g(v_x)) = v_x,
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
v_g(v_f(v_g(v_x))) = v_g(v_x),
inference(monotonicity,[status(thm)],[3]) ).
tff(5,plain,
^ [V_U: $i] :
refl(
( ( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) )
<=> ( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) ) )),
inference(bind,[status(th)],]) ).
tff(6,plain,
( ! [V_U: $i] :
( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) )
<=> ! [V_U: $i] :
( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) ) ),
inference(quant_intro,[status(thm)],[5]) ).
tff(7,plain,
( ! [V_U: $i] :
( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) )
<=> ! [V_U: $i] :
( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(8,plain,
^ [V_U: $i] :
rewrite(
( ( ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) )
| ( v_g(v_f(V_U)) != V_U ) )
<=> ( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) ) )),
inference(bind,[status(th)],]) ).
tff(9,plain,
( ! [V_U: $i] :
( ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) )
| ( v_g(v_f(V_U)) != V_U ) )
<=> ! [V_U: $i] :
( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) ) ),
inference(quant_intro,[status(thm)],[8]) ).
tff(10,axiom,
! [V_U: $i] :
( ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) )
| ( v_g(v_f(V_U)) != V_U ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
tff(11,plain,
! [V_U: $i] :
( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) ),
inference(modus_ponens,[status(thm)],[10,9]) ).
tff(12,plain,
! [V_U: $i] :
( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) ),
inference(modus_ponens,[status(thm)],[11,7]) ).
tff(13,plain,
! [V_U: $i] :
( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) ),
inference(skolemize,[status(sab)],[12]) ).
tff(14,plain,
! [V_U: $i] :
( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) ),
inference(modus_ponens,[status(thm)],[13,6]) ).
tff(15,plain,
( ( ~ ! [V_U: $i] :
( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) )
| ( v_g(v_f(v_g(v_x))) != v_g(v_x) )
| ( v_g(v_f(v_xa(v_g(v_x)))) = v_xa(v_g(v_x)) ) )
<=> ( ~ ! [V_U: $i] :
( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) )
| ( v_g(v_f(v_g(v_x))) != v_g(v_x) )
| ( v_g(v_f(v_xa(v_g(v_x)))) = v_xa(v_g(v_x)) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(16,plain,
( ~ ! [V_U: $i] :
( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) )
| ( v_g(v_f(v_g(v_x))) != v_g(v_x) )
| ( v_g(v_f(v_xa(v_g(v_x)))) = v_xa(v_g(v_x)) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(17,plain,
( ~ ! [V_U: $i] :
( ( v_g(v_f(V_U)) != V_U )
| ( v_g(v_f(v_xa(V_U))) = v_xa(V_U) ) )
| ( v_g(v_f(v_g(v_x))) != v_g(v_x) )
| ( v_g(v_f(v_xa(v_g(v_x)))) = v_xa(v_g(v_x)) ) ),
inference(modus_ponens,[status(thm)],[16,15]) ).
tff(18,plain,
v_g(v_f(v_xa(v_g(v_x)))) = v_xa(v_g(v_x)),
inference(unit_resolution,[status(thm)],[17,14,4]) ).
tff(19,plain,
v_f(v_g(v_f(v_xa(v_g(v_x))))) = v_f(v_xa(v_g(v_x))),
inference(monotonicity,[status(thm)],[18]) ).
tff(20,plain,
^ [V_U: $i] :
refl(
( ( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) )
<=> ( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) ) )),
inference(bind,[status(th)],]) ).
tff(21,plain,
( ! [V_U: $i] :
( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) )
<=> ! [V_U: $i] :
( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) ) ),
inference(quant_intro,[status(thm)],[20]) ).
tff(22,plain,
( ! [V_U: $i] :
( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) )
<=> ! [V_U: $i] :
( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(23,plain,
^ [V_U: $i] :
rewrite(
( ( ( V_U = v_x )
| ( v_f(v_g(V_U)) != V_U ) )
<=> ( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) ) )),
inference(bind,[status(th)],]) ).
tff(24,plain,
( ! [V_U: $i] :
( ( V_U = v_x )
| ( v_f(v_g(V_U)) != V_U ) )
<=> ! [V_U: $i] :
( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) ) ),
inference(quant_intro,[status(thm)],[23]) ).
tff(25,axiom,
! [V_U: $i] :
( ( V_U = v_x )
| ( v_f(v_g(V_U)) != V_U ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
tff(26,plain,
! [V_U: $i] :
( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) ),
inference(modus_ponens,[status(thm)],[25,24]) ).
tff(27,plain,
! [V_U: $i] :
( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) ),
inference(modus_ponens,[status(thm)],[26,22]) ).
tff(28,plain,
! [V_U: $i] :
( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) ),
inference(skolemize,[status(sab)],[27]) ).
tff(29,plain,
! [V_U: $i] :
( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) ),
inference(modus_ponens,[status(thm)],[28,21]) ).
tff(30,plain,
( ( ~ ! [V_U: $i] :
( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) )
| ( v_f(v_g(v_f(v_xa(v_g(v_x))))) != v_f(v_xa(v_g(v_x))) )
| ( v_f(v_xa(v_g(v_x))) = v_x ) )
<=> ( ~ ! [V_U: $i] :
( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) )
| ( v_f(v_g(v_f(v_xa(v_g(v_x))))) != v_f(v_xa(v_g(v_x))) )
| ( v_f(v_xa(v_g(v_x))) = v_x ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(31,plain,
( ~ ! [V_U: $i] :
( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) )
| ( v_f(v_g(v_f(v_xa(v_g(v_x))))) != v_f(v_xa(v_g(v_x))) )
| ( v_f(v_xa(v_g(v_x))) = v_x ) ),
inference(quant_inst,[status(thm)],]) ).
tff(32,plain,
( ~ ! [V_U: $i] :
( ( v_f(v_g(V_U)) != V_U )
| ( V_U = v_x ) )
| ( v_f(v_g(v_f(v_xa(v_g(v_x))))) != v_f(v_xa(v_g(v_x))) )
| ( v_f(v_xa(v_g(v_x))) = v_x ) ),
inference(modus_ponens,[status(thm)],[31,30]) ).
tff(33,plain,
( ( v_f(v_g(v_f(v_xa(v_g(v_x))))) != v_f(v_xa(v_g(v_x))) )
| ( v_f(v_xa(v_g(v_x))) = v_x ) ),
inference(unit_resolution,[status(thm)],[32,29]) ).
tff(34,plain,
v_f(v_xa(v_g(v_x))) = v_x,
inference(unit_resolution,[status(thm)],[33,19]) ).
tff(35,plain,
v_g(v_f(v_xa(v_g(v_x)))) = v_g(v_x),
inference(monotonicity,[status(thm)],[34]) ).
tff(36,plain,
v_xa(v_g(v_x)) = v_g(v_f(v_xa(v_g(v_x)))),
inference(symmetry,[status(thm)],[18]) ).
tff(37,plain,
v_xa(v_g(v_x)) = v_g(v_x),
inference(transitivity,[status(thm)],[36,35]) ).
tff(38,plain,
^ [V_U: $i] :
refl(
( ( ( v_xa(V_U) != V_U )
| ( v_g(v_f(V_U)) != V_U ) )
<=> ( ( v_xa(V_U) != V_U )
| ( v_g(v_f(V_U)) != V_U ) ) )),
inference(bind,[status(th)],]) ).
tff(39,plain,
( ! [V_U: $i] :
( ( v_xa(V_U) != V_U )
| ( v_g(v_f(V_U)) != V_U ) )
<=> ! [V_U: $i] :
( ( v_xa(V_U) != V_U )
| ( v_g(v_f(V_U)) != V_U ) ) ),
inference(quant_intro,[status(thm)],[38]) ).
tff(40,plain,
( ! [V_U: $i] :
( ( v_xa(V_U) != V_U )
| ( v_g(v_f(V_U)) != V_U ) )
<=> ! [V_U: $i] :
( ( v_xa(V_U) != V_U )
| ( v_g(v_f(V_U)) != V_U ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(41,axiom,
! [V_U: $i] :
( ( v_xa(V_U) != V_U )
| ( v_g(v_f(V_U)) != V_U ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
tff(42,plain,
! [V_U: $i] :
( ( v_xa(V_U) != V_U )
| ( v_g(v_f(V_U)) != V_U ) ),
inference(modus_ponens,[status(thm)],[41,40]) ).
tff(43,plain,
! [V_U: $i] :
( ( v_xa(V_U) != V_U )
| ( v_g(v_f(V_U)) != V_U ) ),
inference(skolemize,[status(sab)],[42]) ).
tff(44,plain,
! [V_U: $i] :
( ( v_xa(V_U) != V_U )
| ( v_g(v_f(V_U)) != V_U ) ),
inference(modus_ponens,[status(thm)],[43,39]) ).
tff(45,plain,
( ( ~ ! [V_U: $i] :
( ( v_xa(V_U) != V_U )
| ( v_g(v_f(V_U)) != V_U ) )
| ( v_xa(v_g(v_x)) != v_g(v_x) )
| ( v_g(v_f(v_g(v_x))) != v_g(v_x) ) )
<=> ( ~ ! [V_U: $i] :
( ( v_xa(V_U) != V_U )
| ( v_g(v_f(V_U)) != V_U ) )
| ( v_xa(v_g(v_x)) != v_g(v_x) )
| ( v_g(v_f(v_g(v_x))) != v_g(v_x) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(46,plain,
( ~ ! [V_U: $i] :
( ( v_xa(V_U) != V_U )
| ( v_g(v_f(V_U)) != V_U ) )
| ( v_xa(v_g(v_x)) != v_g(v_x) )
| ( v_g(v_f(v_g(v_x))) != v_g(v_x) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(47,plain,
( ~ ! [V_U: $i] :
( ( v_xa(V_U) != V_U )
| ( v_g(v_f(V_U)) != V_U ) )
| ( v_xa(v_g(v_x)) != v_g(v_x) )
| ( v_g(v_f(v_g(v_x))) != v_g(v_x) ) ),
inference(modus_ponens,[status(thm)],[46,45]) ).
tff(48,plain,
( ( v_xa(v_g(v_x)) != v_g(v_x) )
| ( v_g(v_f(v_g(v_x))) != v_g(v_x) ) ),
inference(unit_resolution,[status(thm)],[47,44]) ).
tff(49,plain,
v_xa(v_g(v_x)) != v_g(v_x),
inference(unit_resolution,[status(thm)],[48,4]) ).
tff(50,plain,
$false,
inference(unit_resolution,[status(thm)],[49,37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET838-1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Sep 3 08:34:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.34 Usage: tptp [options] [-file:]file
% 0.12/0.34 -h, -? prints this message.
% 0.12/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.12/0.34 -m, -model generate model.
% 0.12/0.34 -p, -proof generate proof.
% 0.12/0.34 -c, -core generate unsat core of named formulas.
% 0.12/0.34 -st, -statistics display statistics.
% 0.12/0.34 -t:timeout set timeout (in second).
% 0.12/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.12/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.34 -<param>:<value> configuration parameter and value.
% 0.12/0.34 -o:<output-file> file to place output in.
% 0.44/0.61 % SZS status Unsatisfiable
% 0.44/0.61 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------