TSTP Solution File: SWV069+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWV069+1 : TPTP v8.1.0. Bugfixed v3.3.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 : Thu Sep 29 15:09:51 EDT 2022
% Result : Theorem 0.20s 0.43s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 45
% Syntax : Number of formulae : 89 ( 28 unt; 12 typ; 0 def)
% Number of atoms : 203 ( 30 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 187 ( 66 ~; 38 |; 33 &)
% ( 45 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of FOOLs : 5 ( 5 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 77 ( 69 !; 0 ?; 77 :)
% Comments :
%------------------------------------------------------------------------------
tff(leq_type,type,
leq: ( $i * $i ) > $o ).
tff(minus_type,type,
minus: ( $i * $i ) > $i ).
tff(succ_type,type,
succ: $i > $i ).
tff(tptp_minus_1_type,type,
tptp_minus_1: $i ).
tff(pred_type,type,
pred: $i > $i ).
tff(n1_type,type,
n1: $i ).
tff(gt_type,type,
gt: ( $i * $i ) > $o ).
tff(n0_type,type,
n0: $i ).
tff(n4_type,type,
n4: $i ).
tff(n5_type,type,
n5: $i ).
tff(n135300_type,type,
n135300: $i ).
tff(pv10_type,type,
pv10: $i ).
tff(1,plain,
( ! [X: $i] : ( pred(succ(X)) = X )
<=> ! [X: $i] : ( pred(succ(X)) = X ) ),
inference(rewrite,[status(thm)],]) ).
tff(2,plain,
( ! [X: $i] : ( pred(succ(X)) = X )
<=> ! [X: $i] : ( pred(succ(X)) = X ) ),
inference(rewrite,[status(thm)],]) ).
tff(3,axiom,
! [X: $i] : ( pred(succ(X)) = X ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
tff(4,plain,
! [X: $i] : ( pred(succ(X)) = X ),
inference(modus_ponens,[status(thm)],[3,2]) ).
tff(5,plain,
! [X: $i] : ( pred(succ(X)) = X ),
inference(skolemize,[status(sab)],[4]) ).
tff(6,plain,
! [X: $i] : ( pred(succ(X)) = X ),
inference(modus_ponens,[status(thm)],[5,1]) ).
tff(7,plain,
( ~ ! [X: $i] : ( pred(succ(X)) = X )
| ( pred(succ(succ(succ(succ(succ(succ(tptp_minus_1))))))) = succ(succ(succ(succ(succ(tptp_minus_1))))) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(8,plain,
pred(succ(succ(succ(succ(succ(succ(tptp_minus_1))))))) = succ(succ(succ(succ(succ(tptp_minus_1))))),
inference(unit_resolution,[status(thm)],[7,6]) ).
tff(9,plain,
^ [X: $i] :
refl(
( ( minus(X,succ(succ(tptp_minus_1))) = pred(X) )
<=> ( minus(X,succ(succ(tptp_minus_1))) = pred(X) ) )),
inference(bind,[status(th)],]) ).
tff(10,plain,
( ! [X: $i] : ( minus(X,succ(succ(tptp_minus_1))) = pred(X) )
<=> ! [X: $i] : ( minus(X,succ(succ(tptp_minus_1))) = pred(X) ) ),
inference(quant_intro,[status(thm)],[9]) ).
tff(11,plain,
^ [X: $i] :
rewrite(
( ( minus(X,n1) = pred(X) )
<=> ( minus(X,succ(succ(tptp_minus_1))) = pred(X) ) )),
inference(bind,[status(th)],]) ).
tff(12,plain,
( ! [X: $i] : ( minus(X,n1) = pred(X) )
<=> ! [X: $i] : ( minus(X,succ(succ(tptp_minus_1))) = pred(X) ) ),
inference(quant_intro,[status(thm)],[11]) ).
tff(13,plain,
( ! [X: $i] : ( minus(X,n1) = pred(X) )
<=> ! [X: $i] : ( minus(X,n1) = pred(X) ) ),
inference(rewrite,[status(thm)],]) ).
tff(14,axiom,
! [X: $i] : ( minus(X,n1) = pred(X) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
tff(15,plain,
! [X: $i] : ( minus(X,n1) = pred(X) ),
inference(modus_ponens,[status(thm)],[14,13]) ).
tff(16,plain,
! [X: $i] : ( minus(X,succ(succ(tptp_minus_1))) = pred(X) ),
inference(modus_ponens,[status(thm)],[15,12]) ).
tff(17,plain,
! [X: $i] : ( minus(X,succ(succ(tptp_minus_1))) = pred(X) ),
inference(skolemize,[status(sab)],[16]) ).
tff(18,plain,
! [X: $i] : ( minus(X,succ(succ(tptp_minus_1))) = pred(X) ),
inference(modus_ponens,[status(thm)],[17,10]) ).
tff(19,plain,
( ~ ! [X: $i] : ( minus(X,succ(succ(tptp_minus_1))) = pred(X) )
| ( minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1))) = pred(succ(succ(succ(succ(succ(succ(tptp_minus_1))))))) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(20,plain,
minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1))) = pred(succ(succ(succ(succ(succ(succ(tptp_minus_1))))))),
inference(unit_resolution,[status(thm)],[19,18]) ).
tff(21,plain,
minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1))) = succ(succ(succ(succ(succ(tptp_minus_1))))),
inference(transitivity,[status(thm)],[20,8]) ).
tff(22,plain,
( leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1))))
<=> leq(succ(tptp_minus_1),succ(succ(succ(succ(succ(tptp_minus_1)))))) ),
inference(monotonicity,[status(thm)],[21]) ).
tff(23,plain,
( leq(succ(tptp_minus_1),succ(succ(succ(succ(succ(tptp_minus_1))))))
<=> leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1)))) ),
inference(symmetry,[status(thm)],[22]) ).
tff(24,plain,
( gt(n4,n0)
<=> gt(succ(succ(succ(succ(succ(tptp_minus_1))))),succ(tptp_minus_1)) ),
inference(rewrite,[status(thm)],]) ).
tff(25,plain,
( gt(n4,n0)
<=> gt(n4,n0) ),
inference(rewrite,[status(thm)],]) ).
tff(26,axiom,
gt(n4,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_4_0) ).
tff(27,plain,
gt(n4,n0),
inference(modus_ponens,[status(thm)],[26,25]) ).
tff(28,plain,
gt(succ(succ(succ(succ(succ(tptp_minus_1))))),succ(tptp_minus_1)),
inference(modus_ponens,[status(thm)],[27,24]) ).
tff(29,plain,
^ [X: $i,Y: $i] :
refl(
( ( ~ gt(Y,X)
| leq(X,Y) )
<=> ( ~ gt(Y,X)
| leq(X,Y) ) )),
inference(bind,[status(th)],]) ).
tff(30,plain,
( ! [X: $i,Y: $i] :
( ~ gt(Y,X)
| leq(X,Y) )
<=> ! [X: $i,Y: $i] :
( ~ gt(Y,X)
| leq(X,Y) ) ),
inference(quant_intro,[status(thm)],[29]) ).
tff(31,plain,
( ! [X: $i,Y: $i] :
( ~ gt(Y,X)
| leq(X,Y) )
<=> ! [X: $i,Y: $i] :
( ~ gt(Y,X)
| leq(X,Y) ) ),
inference(rewrite,[status(thm)],]) ).
tff(32,plain,
^ [X: $i,Y: $i] :
rewrite(
( ( gt(Y,X)
=> leq(X,Y) )
<=> ( ~ gt(Y,X)
| leq(X,Y) ) )),
inference(bind,[status(th)],]) ).
tff(33,plain,
( ! [X: $i,Y: $i] :
( gt(Y,X)
=> leq(X,Y) )
<=> ! [X: $i,Y: $i] :
( ~ gt(Y,X)
| leq(X,Y) ) ),
inference(quant_intro,[status(thm)],[32]) ).
tff(34,axiom,
! [X: $i,Y: $i] :
( gt(Y,X)
=> leq(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
tff(35,plain,
! [X: $i,Y: $i] :
( ~ gt(Y,X)
| leq(X,Y) ),
inference(modus_ponens,[status(thm)],[34,33]) ).
tff(36,plain,
! [X: $i,Y: $i] :
( ~ gt(Y,X)
| leq(X,Y) ),
inference(modus_ponens,[status(thm)],[35,31]) ).
tff(37,plain,
! [X: $i,Y: $i] :
( ~ gt(Y,X)
| leq(X,Y) ),
inference(skolemize,[status(sab)],[36]) ).
tff(38,plain,
! [X: $i,Y: $i] :
( ~ gt(Y,X)
| leq(X,Y) ),
inference(modus_ponens,[status(thm)],[37,30]) ).
tff(39,plain,
( ( ~ ! [X: $i,Y: $i] :
( ~ gt(Y,X)
| leq(X,Y) )
| ~ gt(succ(succ(succ(succ(succ(tptp_minus_1))))),succ(tptp_minus_1))
| leq(succ(tptp_minus_1),succ(succ(succ(succ(succ(tptp_minus_1)))))) )
<=> ( ~ ! [X: $i,Y: $i] :
( ~ gt(Y,X)
| leq(X,Y) )
| ~ gt(succ(succ(succ(succ(succ(tptp_minus_1))))),succ(tptp_minus_1))
| leq(succ(tptp_minus_1),succ(succ(succ(succ(succ(tptp_minus_1)))))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(40,plain,
( ~ ! [X: $i,Y: $i] :
( ~ gt(Y,X)
| leq(X,Y) )
| ~ gt(succ(succ(succ(succ(succ(tptp_minus_1))))),succ(tptp_minus_1))
| leq(succ(tptp_minus_1),succ(succ(succ(succ(succ(tptp_minus_1)))))) ),
inference(quant_inst,[status(thm)],]) ).
tff(41,plain,
( ~ ! [X: $i,Y: $i] :
( ~ gt(Y,X)
| leq(X,Y) )
| ~ gt(succ(succ(succ(succ(succ(tptp_minus_1))))),succ(tptp_minus_1))
| leq(succ(tptp_minus_1),succ(succ(succ(succ(succ(tptp_minus_1)))))) ),
inference(modus_ponens,[status(thm)],[40,39]) ).
tff(42,plain,
leq(succ(tptp_minus_1),succ(succ(succ(succ(succ(tptp_minus_1)))))),
inference(unit_resolution,[status(thm)],[41,38,28]) ).
tff(43,plain,
leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1)))),
inference(modus_ponens,[status(thm)],[42,23]) ).
tff(44,plain,
^ [X: $i,Y: $i] :
refl(
( ( leq(X,Y)
<=> gt(succ(Y),X) )
<=> ( leq(X,Y)
<=> gt(succ(Y),X) ) )),
inference(bind,[status(th)],]) ).
tff(45,plain,
( ! [X: $i,Y: $i] :
( leq(X,Y)
<=> gt(succ(Y),X) )
<=> ! [X: $i,Y: $i] :
( leq(X,Y)
<=> gt(succ(Y),X) ) ),
inference(quant_intro,[status(thm)],[44]) ).
tff(46,plain,
( ! [X: $i,Y: $i] :
( leq(X,Y)
<=> gt(succ(Y),X) )
<=> ! [X: $i,Y: $i] :
( leq(X,Y)
<=> gt(succ(Y),X) ) ),
inference(rewrite,[status(thm)],]) ).
tff(47,axiom,
! [X: $i,Y: $i] :
( leq(X,Y)
<=> gt(succ(Y),X) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
tff(48,plain,
! [X: $i,Y: $i] :
( leq(X,Y)
<=> gt(succ(Y),X) ),
inference(modus_ponens,[status(thm)],[47,46]) ).
tff(49,plain,
! [X: $i,Y: $i] :
( leq(X,Y)
<=> gt(succ(Y),X) ),
inference(skolemize,[status(sab)],[48]) ).
tff(50,plain,
! [X: $i,Y: $i] :
( leq(X,Y)
<=> gt(succ(Y),X) ),
inference(modus_ponens,[status(thm)],[49,45]) ).
tff(51,plain,
( ~ ! [X: $i,Y: $i] :
( leq(X,Y)
<=> gt(succ(Y),X) )
| ( leq(succ(tptp_minus_1),succ(tptp_minus_1))
<=> gt(succ(succ(tptp_minus_1)),succ(tptp_minus_1)) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(52,plain,
( leq(succ(tptp_minus_1),succ(tptp_minus_1))
<=> gt(succ(succ(tptp_minus_1)),succ(tptp_minus_1)) ),
inference(unit_resolution,[status(thm)],[51,50]) ).
tff(53,plain,
( gt(n1,n0)
<=> gt(succ(succ(tptp_minus_1)),succ(tptp_minus_1)) ),
inference(rewrite,[status(thm)],]) ).
tff(54,plain,
( gt(n1,n0)
<=> gt(n1,n0) ),
inference(rewrite,[status(thm)],]) ).
tff(55,axiom,
gt(n1,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_1_0) ).
tff(56,plain,
gt(n1,n0),
inference(modus_ponens,[status(thm)],[55,54]) ).
tff(57,plain,
gt(succ(succ(tptp_minus_1)),succ(tptp_minus_1)),
inference(modus_ponens,[status(thm)],[56,53]) ).
tff(58,plain,
( ~ ( leq(succ(tptp_minus_1),succ(tptp_minus_1))
<=> gt(succ(succ(tptp_minus_1)),succ(tptp_minus_1)) )
| leq(succ(tptp_minus_1),succ(tptp_minus_1))
| ~ gt(succ(succ(tptp_minus_1)),succ(tptp_minus_1)) ),
inference(tautology,[status(thm)],]) ).
tff(59,plain,
( ~ ( leq(succ(tptp_minus_1),succ(tptp_minus_1))
<=> gt(succ(succ(tptp_minus_1)),succ(tptp_minus_1)) )
| leq(succ(tptp_minus_1),succ(tptp_minus_1)) ),
inference(unit_resolution,[status(thm)],[58,57]) ).
tff(60,plain,
leq(succ(tptp_minus_1),succ(tptp_minus_1)),
inference(unit_resolution,[status(thm)],[59,52]) ).
tff(61,plain,
( ~ ~ ( ~ leq(succ(tptp_minus_1),succ(tptp_minus_1))
| ~ leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1)))) )
<=> ( ~ leq(succ(tptp_minus_1),succ(tptp_minus_1))
| ~ leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1)))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(62,plain,
( ( leq(succ(tptp_minus_1),succ(tptp_minus_1))
& leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1)))) )
<=> ~ ( ~ leq(succ(tptp_minus_1),succ(tptp_minus_1))
| ~ leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1)))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(63,plain,
( ~ ( leq(succ(tptp_minus_1),succ(tptp_minus_1))
& leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1)))) )
<=> ~ ~ ( ~ leq(succ(tptp_minus_1),succ(tptp_minus_1))
| ~ leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1)))) ) ),
inference(monotonicity,[status(thm)],[62]) ).
tff(64,plain,
( ~ ( leq(succ(tptp_minus_1),succ(tptp_minus_1))
& leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1)))) )
<=> ( ~ leq(succ(tptp_minus_1),succ(tptp_minus_1))
| ~ leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1)))) ) ),
inference(transitivity,[status(thm)],[63,61]) ).
tff(65,plain,
( ~ ( leq(n0,n0)
& leq(n0,minus(n5,n1)) )
<=> ~ ( leq(succ(tptp_minus_1),succ(tptp_minus_1))
& leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1)))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(66,plain,
( ~ ( leq(n0,n0)
& leq(n0,minus(n5,n1)) )
<=> ~ ( leq(n0,n0)
& leq(n0,minus(n5,n1)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(67,plain,
( ~ ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,minus(n5,n1))
& leq(pv10,minus(n135300,n1)) )
<=> ~ ( leq(n0,n0)
& leq(n0,minus(n5,n1)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(68,plain,
( ~ ( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,minus(n5,n1))
& leq(pv10,minus(n135300,n1)) ) )
<=> ~ ( ~ ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) )
| ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,minus(n5,n1))
& leq(pv10,minus(n135300,n1)) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(69,axiom,
~ ( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,minus(n5,n1))
& leq(pv10,minus(n135300,n1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0010) ).
tff(70,plain,
~ ( ~ ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) )
| ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,minus(n5,n1))
& leq(pv10,minus(n135300,n1)) ) ),
inference(modus_ponens,[status(thm)],[69,68]) ).
tff(71,plain,
~ ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,minus(n5,n1))
& leq(pv10,minus(n135300,n1)) ),
inference(or_elim,[status(thm)],[70]) ).
tff(72,plain,
~ ( leq(n0,n0)
& leq(n0,minus(n5,n1)) ),
inference(modus_ponens,[status(thm)],[71,67]) ).
tff(73,plain,
~ ( leq(n0,n0)
& leq(n0,minus(n5,n1)) ),
inference(modus_ponens,[status(thm)],[72,66]) ).
tff(74,plain,
~ ( leq(succ(tptp_minus_1),succ(tptp_minus_1))
& leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1)))) ),
inference(modus_ponens,[status(thm)],[73,65]) ).
tff(75,plain,
( ~ leq(succ(tptp_minus_1),succ(tptp_minus_1))
| ~ leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1)))) ),
inference(modus_ponens,[status(thm)],[74,64]) ).
tff(76,plain,
~ leq(succ(tptp_minus_1),minus(succ(succ(succ(succ(succ(succ(tptp_minus_1)))))),succ(succ(tptp_minus_1)))),
inference(unit_resolution,[status(thm)],[75,60]) ).
tff(77,plain,
$false,
inference(unit_resolution,[status(thm)],[76,43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV069+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.34 % Computer : n008.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 : Sun Sep 4 01:20:55 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.20/0.43 % SZS status Theorem
% 0.20/0.43 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------