TSTP Solution File: LCL176-3 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : LCL176-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n009.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 04:55:13 EDT 2022
% Result : Unsatisfiable 0.21s 0.48s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 49
% Syntax : Number of formulae : 118 ( 48 unt; 6 typ; 0 def)
% Number of atoms : 316 ( 25 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 370 ( 173 ~; 160 |; 0 &)
% ( 37 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 10 ( 3 avg)
% Number of FOOLs : 7 ( 7 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 174 ( 160 !; 0 ?; 174 :)
% Comments :
%------------------------------------------------------------------------------
tff(axiom_type,type,
axiom: $i > $o ).
tff(or_type,type,
or: ( $i * $i ) > $i ).
tff(p_type,type,
p: $i ).
tff(not_type,type,
not: $i > $i ).
tff(implies_type,type,
implies: ( $i * $i ) > $i ).
tff(theorem_type,type,
theorem: $i > $o ).
tff(1,plain,
^ [Y: $i,X: $i] :
refl(
( ( implies(X,Y) = or(not(X),Y) )
<=> ( implies(X,Y) = or(not(X),Y) ) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
<=> ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
<=> ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ) ),
inference(rewrite,[status(thm)],]) ).
tff(4,axiom,
! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
tff(5,plain,
! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
( ~ ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
| ( implies(p,or(not(or(not(p),or(not(or(p,not(p))),p))),p)) = or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(9,plain,
implies(p,or(not(or(not(p),or(not(or(p,not(p))),p))),p)) = or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)) = implies(p,or(not(or(not(p),or(not(or(p,not(p))),p))),p)),
inference(symmetry,[status(thm)],[9]) ).
tff(11,plain,
( axiom(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)))
<=> axiom(implies(p,or(not(or(not(p),or(not(or(p,not(p))),p))),p))) ),
inference(monotonicity,[status(thm)],[10]) ).
tff(12,plain,
( axiom(implies(p,or(not(or(not(p),or(not(or(p,not(p))),p))),p)))
<=> axiom(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p))) ),
inference(symmetry,[status(thm)],[11]) ).
tff(13,plain,
^ [B: $i,A: $i] :
refl(
( axiom(implies(A,or(B,A)))
<=> axiom(implies(A,or(B,A))) )),
inference(bind,[status(th)],]) ).
tff(14,plain,
( ! [B: $i,A: $i] : axiom(implies(A,or(B,A)))
<=> ! [B: $i,A: $i] : axiom(implies(A,or(B,A))) ),
inference(quant_intro,[status(thm)],[13]) ).
tff(15,plain,
( ! [B: $i,A: $i] : axiom(implies(A,or(B,A)))
<=> ! [B: $i,A: $i] : axiom(implies(A,or(B,A))) ),
inference(rewrite,[status(thm)],]) ).
tff(16,axiom,
! [B: $i,A: $i] : axiom(implies(A,or(B,A))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
tff(17,plain,
! [B: $i,A: $i] : axiom(implies(A,or(B,A))),
inference(modus_ponens,[status(thm)],[16,15]) ).
tff(18,plain,
! [B: $i,A: $i] : axiom(implies(A,or(B,A))),
inference(skolemize,[status(sab)],[17]) ).
tff(19,plain,
! [B: $i,A: $i] : axiom(implies(A,or(B,A))),
inference(modus_ponens,[status(thm)],[18,14]) ).
tff(20,plain,
( ~ ! [B: $i,A: $i] : axiom(implies(A,or(B,A)))
| axiom(implies(p,or(not(or(not(p),or(not(or(p,not(p))),p))),p))) ),
inference(quant_inst,[status(thm)],]) ).
tff(21,plain,
axiom(implies(p,or(not(or(not(p),or(not(or(p,not(p))),p))),p))),
inference(unit_resolution,[status(thm)],[20,19]) ).
tff(22,plain,
axiom(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p))),
inference(modus_ponens,[status(thm)],[21,12]) ).
tff(23,plain,
^ [B: $i,A: $i,C: $i] :
refl(
( axiom(implies(or(A,or(B,C)),or(B,or(A,C))))
<=> axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) )),
inference(bind,[status(th)],]) ).
tff(24,plain,
( ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C))))
<=> ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) ),
inference(quant_intro,[status(thm)],[23]) ).
tff(25,plain,
( ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C))))
<=> ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) ),
inference(rewrite,[status(thm)],]) ).
tff(26,axiom,
! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
tff(27,plain,
! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
inference(modus_ponens,[status(thm)],[26,25]) ).
tff(28,plain,
! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
inference(skolemize,[status(sab)],[27]) ).
tff(29,plain,
! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
inference(modus_ponens,[status(thm)],[28,24]) ).
tff(30,plain,
( ~ ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C))))
| axiom(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))) ),
inference(quant_inst,[status(thm)],]) ).
tff(31,plain,
axiom(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))),
inference(unit_resolution,[status(thm)],[30,29]) ).
tff(32,plain,
^ [X: $i] :
refl(
( ( theorem(X)
| ~ axiom(X) )
<=> ( theorem(X)
| ~ axiom(X) ) )),
inference(bind,[status(th)],]) ).
tff(33,plain,
( ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
<=> ! [X: $i] :
( theorem(X)
| ~ axiom(X) ) ),
inference(quant_intro,[status(thm)],[32]) ).
tff(34,plain,
( ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
<=> ! [X: $i] :
( theorem(X)
| ~ axiom(X) ) ),
inference(rewrite,[status(thm)],]) ).
tff(35,axiom,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
tff(36,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(modus_ponens,[status(thm)],[35,34]) ).
tff(37,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(skolemize,[status(sab)],[36]) ).
tff(38,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(modus_ponens,[status(thm)],[37,33]) ).
tff(39,plain,
( ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p))))
| ~ axiom(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))) )
<=> ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p))))
| ~ axiom(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(40,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p))))
| ~ axiom(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))) ),
inference(quant_inst,[status(thm)],]) ).
tff(41,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p))))
| ~ axiom(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))) ),
inference(modus_ponens,[status(thm)],[40,39]) ).
tff(42,plain,
theorem(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))),
inference(unit_resolution,[status(thm)],[41,38,31]) ).
tff(43,plain,
( ~ ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
| ( implies(or(not(p),or(not(or(p,not(p))),p)),or(not(p),p)) = or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(44,plain,
implies(or(not(p),or(not(or(p,not(p))),p)),or(not(p),p)) = or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)),
inference(unit_resolution,[status(thm)],[43,7]) ).
tff(45,plain,
( theorem(implies(or(not(p),or(not(or(p,not(p))),p)),or(not(p),p)))
<=> theorem(or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p))) ),
inference(monotonicity,[status(thm)],[44]) ).
tff(46,plain,
( ~ theorem(implies(or(not(p),or(not(or(p,not(p))),p)),or(not(p),p)))
<=> ~ theorem(or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p))) ),
inference(monotonicity,[status(thm)],[45]) ).
tff(47,plain,
( ~ ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
| ( implies(or(p,not(p)),or(not(p),p)) = or(not(or(p,not(p))),or(not(p),p)) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(48,plain,
implies(or(p,not(p)),or(not(p),p)) = or(not(or(p,not(p))),or(not(p),p)),
inference(unit_resolution,[status(thm)],[47,7]) ).
tff(49,plain,
or(not(or(p,not(p))),or(not(p),p)) = implies(or(p,not(p)),or(not(p),p)),
inference(symmetry,[status(thm)],[48]) ).
tff(50,plain,
( theorem(or(not(or(p,not(p))),or(not(p),p)))
<=> theorem(implies(or(p,not(p)),or(not(p),p))) ),
inference(monotonicity,[status(thm)],[49]) ).
tff(51,plain,
( theorem(implies(or(p,not(p)),or(not(p),p)))
<=> theorem(or(not(or(p,not(p))),or(not(p),p))) ),
inference(symmetry,[status(thm)],[50]) ).
tff(52,plain,
^ [B: $i,A: $i] :
refl(
( axiom(implies(or(A,B),or(B,A)))
<=> axiom(implies(or(A,B),or(B,A))) )),
inference(bind,[status(th)],]) ).
tff(53,plain,
( ! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A)))
<=> ! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))) ),
inference(quant_intro,[status(thm)],[52]) ).
tff(54,plain,
( ! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A)))
<=> ! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))) ),
inference(rewrite,[status(thm)],]) ).
tff(55,axiom,
! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
tff(56,plain,
! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))),
inference(modus_ponens,[status(thm)],[55,54]) ).
tff(57,plain,
! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))),
inference(skolemize,[status(sab)],[56]) ).
tff(58,plain,
! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))),
inference(modus_ponens,[status(thm)],[57,53]) ).
tff(59,plain,
( ~ ! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A)))
| axiom(implies(or(p,not(p)),or(not(p),p))) ),
inference(quant_inst,[status(thm)],]) ).
tff(60,plain,
axiom(implies(or(p,not(p)),or(not(p),p))),
inference(unit_resolution,[status(thm)],[59,58]) ).
tff(61,plain,
( ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(p,not(p)),or(not(p),p)))
| ~ axiom(implies(or(p,not(p)),or(not(p),p))) )
<=> ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(p,not(p)),or(not(p),p)))
| ~ axiom(implies(or(p,not(p)),or(not(p),p))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(62,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(p,not(p)),or(not(p),p)))
| ~ axiom(implies(or(p,not(p)),or(not(p),p))) ),
inference(quant_inst,[status(thm)],]) ).
tff(63,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(p,not(p)),or(not(p),p)))
| ~ axiom(implies(or(p,not(p)),or(not(p),p))) ),
inference(modus_ponens,[status(thm)],[62,61]) ).
tff(64,plain,
theorem(implies(or(p,not(p)),or(not(p),p))),
inference(unit_resolution,[status(thm)],[63,38,60]) ).
tff(65,plain,
theorem(or(not(or(p,not(p))),or(not(p),p))),
inference(modus_ponens,[status(thm)],[64,51]) ).
tff(66,plain,
( ~ ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C))))
| axiom(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p)))) ),
inference(quant_inst,[status(thm)],]) ).
tff(67,plain,
axiom(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p)))),
inference(unit_resolution,[status(thm)],[66,29]) ).
tff(68,plain,
( ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p))))
| ~ axiom(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p)))) )
<=> ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p))))
| ~ axiom(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p)))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(69,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p))))
| ~ axiom(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p)))) ),
inference(quant_inst,[status(thm)],]) ).
tff(70,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p))))
| ~ axiom(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p)))) ),
inference(modus_ponens,[status(thm)],[69,68]) ).
tff(71,plain,
theorem(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p)))),
inference(unit_resolution,[status(thm)],[70,38,67]) ).
tff(72,plain,
^ [Y: $i,X: $i] :
refl(
( ( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
<=> ( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ) )),
inference(bind,[status(th)],]) ).
tff(73,plain,
( ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
<=> ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ) ),
inference(quant_intro,[status(thm)],[72]) ).
tff(74,plain,
( ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
<=> ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(75,plain,
^ [Y: $i,X: $i] :
rewrite(
( ( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) )
<=> ( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ) )),
inference(bind,[status(th)],]) ).
tff(76,plain,
( ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) )
<=> ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ) ),
inference(quant_intro,[status(thm)],[75]) ).
tff(77,axiom,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
tff(78,plain,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ),
inference(modus_ponens,[status(thm)],[77,76]) ).
tff(79,plain,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ),
inference(modus_ponens,[status(thm)],[78,74]) ).
tff(80,plain,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ),
inference(skolemize,[status(sab)],[79]) ).
tff(81,plain,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ),
inference(modus_ponens,[status(thm)],[80,73]) ).
tff(82,plain,
( ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(p),or(not(or(p,not(p))),p)))
| ~ theorem(or(not(or(p,not(p))),or(not(p),p)))
| ~ theorem(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p)))) )
<=> ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(p),or(not(or(p,not(p))),p)))
| ~ theorem(or(not(or(p,not(p))),or(not(p),p)))
| ~ theorem(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p)))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(83,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(p),or(not(or(p,not(p))),p)))
| ~ theorem(or(not(or(p,not(p))),or(not(p),p)))
| ~ theorem(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p)))) ),
inference(quant_inst,[status(thm)],]) ).
tff(84,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(p),or(not(or(p,not(p))),p)))
| ~ theorem(or(not(or(p,not(p))),or(not(p),p)))
| ~ theorem(implies(or(not(or(p,not(p))),or(not(p),p)),or(not(p),or(not(or(p,not(p))),p)))) ),
inference(modus_ponens,[status(thm)],[83,82]) ).
tff(85,plain,
( theorem(or(not(p),or(not(or(p,not(p))),p)))
| ~ theorem(or(not(or(p,not(p))),or(not(p),p))) ),
inference(unit_resolution,[status(thm)],[84,81,71]) ).
tff(86,plain,
theorem(or(not(p),or(not(or(p,not(p))),p))),
inference(unit_resolution,[status(thm)],[85,65]) ).
tff(87,plain,
( ~ ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
| ( implies(p,p) = or(not(p),p) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(88,plain,
implies(p,p) = or(not(p),p),
inference(unit_resolution,[status(thm)],[87,7]) ).
tff(89,plain,
or(not(p),p) = implies(p,p),
inference(symmetry,[status(thm)],[88]) ).
tff(90,plain,
( theorem(or(not(p),p))
<=> theorem(implies(p,p)) ),
inference(monotonicity,[status(thm)],[89]) ).
tff(91,plain,
( theorem(implies(p,p))
<=> theorem(or(not(p),p)) ),
inference(symmetry,[status(thm)],[90]) ).
tff(92,plain,
( ~ theorem(implies(p,p))
<=> ~ theorem(or(not(p),p)) ),
inference(monotonicity,[status(thm)],[91]) ).
tff(93,plain,
( ~ theorem(implies(p,p))
<=> ~ theorem(implies(p,p)) ),
inference(rewrite,[status(thm)],]) ).
tff(94,axiom,
~ theorem(implies(p,p)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(95,plain,
~ theorem(implies(p,p)),
inference(modus_ponens,[status(thm)],[94,93]) ).
tff(96,plain,
~ theorem(or(not(p),p)),
inference(modus_ponens,[status(thm)],[95,92]) ).
tff(97,plain,
( ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(p),p))
| ~ theorem(or(not(p),or(not(or(p,not(p))),p)))
| ~ theorem(implies(or(not(p),or(not(or(p,not(p))),p)),or(not(p),p))) )
<=> ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(p),p))
| ~ theorem(or(not(p),or(not(or(p,not(p))),p)))
| ~ theorem(implies(or(not(p),or(not(or(p,not(p))),p)),or(not(p),p))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(98,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(p),p))
| ~ theorem(or(not(p),or(not(or(p,not(p))),p)))
| ~ theorem(implies(or(not(p),or(not(or(p,not(p))),p)),or(not(p),p))) ),
inference(quant_inst,[status(thm)],]) ).
tff(99,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(p),p))
| ~ theorem(or(not(p),or(not(or(p,not(p))),p)))
| ~ theorem(implies(or(not(p),or(not(or(p,not(p))),p)),or(not(p),p))) ),
inference(modus_ponens,[status(thm)],[98,97]) ).
tff(100,plain,
~ theorem(implies(or(not(p),or(not(or(p,not(p))),p)),or(not(p),p))),
inference(unit_resolution,[status(thm)],[99,81,96,86]) ).
tff(101,plain,
~ theorem(or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p))),
inference(modus_ponens,[status(thm)],[100,46]) ).
tff(102,plain,
( ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))
| ~ theorem(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)))
| ~ theorem(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))) )
<=> ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))
| ~ theorem(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)))
| ~ theorem(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(103,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))
| ~ theorem(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)))
| ~ theorem(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))) ),
inference(quant_inst,[status(thm)],]) ).
tff(104,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))
| ~ theorem(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)))
| ~ theorem(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))) ),
inference(modus_ponens,[status(thm)],[103,102]) ).
tff(105,plain,
( theorem(or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))
| ~ theorem(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)))
| ~ theorem(implies(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)),or(not(or(not(p),or(not(or(p,not(p))),p))),or(not(p),p)))) ),
inference(unit_resolution,[status(thm)],[104,81]) ).
tff(106,plain,
~ theorem(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p))),
inference(unit_resolution,[status(thm)],[105,101,42]) ).
tff(107,plain,
( ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)))
| ~ axiom(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p))) )
<=> ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)))
| ~ axiom(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(108,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)))
| ~ axiom(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p))) ),
inference(quant_inst,[status(thm)],]) ).
tff(109,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)))
| ~ axiom(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p))) ),
inference(modus_ponens,[status(thm)],[108,107]) ).
tff(110,plain,
( theorem(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p)))
| ~ axiom(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p))) ),
inference(unit_resolution,[status(thm)],[109,38]) ).
tff(111,plain,
~ axiom(or(not(p),or(not(or(not(p),or(not(or(p,not(p))),p))),p))),
inference(unit_resolution,[status(thm)],[110,106]) ).
tff(112,plain,
$false,
inference(unit_resolution,[status(thm)],[111,22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL176-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % 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 : Thu Sep 1 18:26:50 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.35 Usage: tptp [options] [-file:]file
% 0.14/0.35 -h, -? prints this message.
% 0.14/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.14/0.35 -m, -model generate model.
% 0.14/0.35 -p, -proof generate proof.
% 0.14/0.35 -c, -core generate unsat core of named formulas.
% 0.14/0.35 -st, -statistics display statistics.
% 0.14/0.35 -t:timeout set timeout (in second).
% 0.14/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.14/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.35 -<param>:<value> configuration parameter and value.
% 0.14/0.35 -o:<output-file> file to place output in.
% 0.21/0.48 % SZS status Unsatisfiable
% 0.21/0.48 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------