TSTP Solution File: SWC349-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWC349-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n002.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 11:57:17 EDT 2022
% Result : Unsatisfiable 0.19s 0.44s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 19
% Syntax : Number of formulae : 31 ( 9 unt; 7 typ; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 71 ( 34 ~; 27 |; 0 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 17 ( 15 !; 0 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
tff(frontsegP_type,type,
frontsegP: ( $i * $i ) > $o ).
tff(sk3_type,type,
sk3: $i ).
tff(sk4_type,type,
sk4: $i ).
tff(sk1_type,type,
sk1: $i ).
tff(sk2_type,type,
sk2: $i ).
tff(ssList_type,type,
ssList: $i > $o ).
tff(nil_type,type,
nil: $i ).
tff(1,plain,
( ~ frontsegP(sk2,sk1)
<=> ~ frontsegP(sk4,sk3) ),
inference(rewrite,[status(thm)],]) ).
tff(2,plain,
( ~ frontsegP(sk2,sk1)
<=> ~ frontsegP(sk2,sk1) ),
inference(rewrite,[status(thm)],]) ).
tff(3,axiom,
~ frontsegP(sk2,sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
tff(4,plain,
~ frontsegP(sk2,sk1),
inference(modus_ponens,[status(thm)],[3,2]) ).
tff(5,plain,
~ frontsegP(sk4,sk3),
inference(modus_ponens,[status(thm)],[4,1]) ).
tff(6,plain,
( ssList(sk2)
<=> ssList(sk4) ),
inference(rewrite,[status(thm)],]) ).
tff(7,plain,
( ssList(sk2)
<=> ssList(sk2) ),
inference(rewrite,[status(thm)],]) ).
tff(8,axiom,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
tff(9,plain,
ssList(sk2),
inference(modus_ponens,[status(thm)],[8,7]) ).
tff(10,plain,
ssList(sk4),
inference(modus_ponens,[status(thm)],[9,6]) ).
tff(11,plain,
^ [U: $i] :
refl(
( ( ~ ssList(U)
| frontsegP(U,sk3) )
<=> ( ~ ssList(U)
| frontsegP(U,sk3) ) )),
inference(bind,[status(th)],]) ).
tff(12,plain,
( ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,sk3) )
<=> ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,sk3) ) ),
inference(quant_intro,[status(thm)],[11]) ).
tff(13,plain,
^ [U: $i] :
rewrite(
( ( ~ ssList(U)
| frontsegP(U,nil) )
<=> ( ~ ssList(U)
| frontsegP(U,sk3) ) )),
inference(bind,[status(th)],]) ).
tff(14,plain,
( ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,nil) )
<=> ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,sk3) ) ),
inference(quant_intro,[status(thm)],[13]) ).
tff(15,plain,
( ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,nil) )
<=> ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,nil) ) ),
inference(rewrite,[status(thm)],]) ).
tff(16,axiom,
! [U: $i] :
( ~ ssList(U)
| frontsegP(U,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause60) ).
tff(17,plain,
! [U: $i] :
( ~ ssList(U)
| frontsegP(U,nil) ),
inference(modus_ponens,[status(thm)],[16,15]) ).
tff(18,plain,
! [U: $i] :
( ~ ssList(U)
| frontsegP(U,sk3) ),
inference(modus_ponens,[status(thm)],[17,14]) ).
tff(19,plain,
! [U: $i] :
( ~ ssList(U)
| frontsegP(U,sk3) ),
inference(skolemize,[status(sab)],[18]) ).
tff(20,plain,
! [U: $i] :
( ~ ssList(U)
| frontsegP(U,sk3) ),
inference(modus_ponens,[status(thm)],[19,12]) ).
tff(21,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,sk3) )
| ~ ssList(sk4)
| frontsegP(sk4,sk3) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,sk3) )
| ~ ssList(sk4)
| frontsegP(sk4,sk3) ) ),
inference(rewrite,[status(thm)],]) ).
tff(22,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,sk3) )
| ~ ssList(sk4)
| frontsegP(sk4,sk3) ),
inference(quant_inst,[status(thm)],]) ).
tff(23,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,sk3) )
| ~ ssList(sk4)
| frontsegP(sk4,sk3) ),
inference(modus_ponens,[status(thm)],[22,21]) ).
tff(24,plain,
$false,
inference(unit_resolution,[status(thm)],[23,20,10,5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC349-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.33 % Computer : n002.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun Sep 4 00:29:32 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34 Usage: tptp [options] [-file:]file
% 0.13/0.34 -h, -? prints this message.
% 0.13/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.34 -m, -model generate model.
% 0.13/0.34 -p, -proof generate proof.
% 0.13/0.34 -c, -core generate unsat core of named formulas.
% 0.13/0.34 -st, -statistics display statistics.
% 0.13/0.34 -t:timeout set timeout (in second).
% 0.13/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34 -<param>:<value> configuration parameter and value.
% 0.13/0.34 -o:<output-file> file to place output in.
% 0.19/0.44 % SZS status Unsatisfiable
% 0.19/0.44 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------