TSTP Solution File: SYN011-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN011-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n011.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 23:53:10 EDT 2022
% Result : Unsatisfiable 0.20s 0.38s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN011-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Sep 5 00:59:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.35 Usage: tptp [options] [-file:]file
% 0.12/0.35 -h, -? prints this message.
% 0.12/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.12/0.35 -m, -model generate model.
% 0.12/0.35 -p, -proof generate proof.
% 0.12/0.35 -c, -core generate unsat core of named formulas.
% 0.12/0.35 -st, -statistics display statistics.
% 0.12/0.35 -t:timeout set timeout (in second).
% 0.12/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.12/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.35 -<param>:<value> configuration parameter and value.
% 0.12/0.35 -o:<output-file> file to place output in.
% 0.20/0.38 % SZS status Unsatisfiable
% 0.20/0.38 % SZS output start Proof
% 0.20/0.38 tff(m_type, type, (
% 0.20/0.38 m: $o)).
% 0.20/0.38 tff(l_type, type, (
% 0.20/0.38 l: $o)).
% 0.20/0.38 tff(p_type, type, (
% 0.20/0.38 p: $o)).
% 0.20/0.38 tff(r_type, type, (
% 0.20/0.38 r: $o)).
% 0.20/0.38 tff(n_type, type, (
% 0.20/0.38 n: $o)).
% 0.20/0.38 tff(t_type, type, (
% 0.20/0.38 t: $o)).
% 0.20/0.38 tff(q_type, type, (
% 0.20/0.38 q: $o)).
% 0.20/0.38 tff(1,assumption,(l), introduced(assumption)).
% 0.20/0.38 tff(2,axiom,((~l) | (~p)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_5')).
% 0.20/0.38 tff(3,plain,
% 0.20/0.38 (~p),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[2, 1])).
% 0.20/0.38 tff(4,plain,
% 0.20/0.38 (((~r) | (~l)) <=> ((~l) | (~r))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(5,axiom,((~r) | (~l)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_7')).
% 0.20/0.38 tff(6,plain,
% 0.20/0.38 ((~l) | (~r)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[5, 4])).
% 0.20/0.38 tff(7,plain,
% 0.20/0.38 (~r),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[6, 1])).
% 0.20/0.38 tff(8,plain,
% 0.20/0.38 (($false | p | r) <=> (p | r)),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(9,plain,
% 0.20/0.38 (((~n) | $false) <=> (~n)),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(10,plain,
% 0.20/0.38 ((~$true) <=> $false),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(11,axiom,(t), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_8')).
% 0.20/0.38 tff(12,plain,
% 0.20/0.38 (t <=> $true),
% 0.20/0.38 inference(iff_true,[status(thm)],[11])).
% 0.20/0.38 tff(13,plain,
% 0.20/0.38 ((~t) <=> (~$true)),
% 0.20/0.38 inference(monotonicity,[status(thm)],[12])).
% 0.20/0.38 tff(14,plain,
% 0.20/0.38 ((~t) <=> $false),
% 0.20/0.38 inference(transitivity,[status(thm)],[13, 10])).
% 0.20/0.38 tff(15,plain,
% 0.20/0.38 (((~n) | (~t)) <=> ((~n) | $false)),
% 0.20/0.38 inference(monotonicity,[status(thm)],[14])).
% 0.20/0.38 tff(16,plain,
% 0.20/0.38 (((~n) | (~t)) <=> (~n)),
% 0.20/0.38 inference(transitivity,[status(thm)],[15, 9])).
% 0.20/0.38 tff(17,axiom,((~n) | (~t)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_1')).
% 0.20/0.38 tff(18,plain,
% 0.20/0.38 (~n),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[17, 16])).
% 0.20/0.38 tff(19,plain,
% 0.20/0.38 (n <=> $false),
% 0.20/0.38 inference(iff_false,[status(thm)],[18])).
% 0.20/0.38 tff(20,plain,
% 0.20/0.38 ((n | p | r) <=> ($false | p | r)),
% 0.20/0.38 inference(monotonicity,[status(thm)],[19])).
% 0.20/0.38 tff(21,plain,
% 0.20/0.38 ((n | p | r) <=> (p | r)),
% 0.20/0.38 inference(transitivity,[status(thm)],[20, 8])).
% 0.20/0.38 tff(22,plain,
% 0.20/0.38 (((p | r) | n) <=> (n | p | r)),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(23,plain,
% 0.20/0.38 ((r | p) <=> (p | r)),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(24,plain,
% 0.20/0.38 (((r | p) | n) <=> ((p | r) | n)),
% 0.20/0.38 inference(monotonicity,[status(thm)],[23])).
% 0.20/0.38 tff(25,plain,
% 0.20/0.38 (((r | p) | n) <=> (n | p | r)),
% 0.20/0.38 inference(transitivity,[status(thm)],[24, 22])).
% 0.20/0.38 tff(26,axiom,((r | p) | n), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_6')).
% 0.20/0.38 tff(27,plain,
% 0.20/0.38 (n | p | r),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[26, 25])).
% 0.20/0.38 tff(28,plain,
% 0.20/0.38 (p | r),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[27, 21])).
% 0.20/0.38 tff(29,plain,
% 0.20/0.38 ($false),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[28, 7, 3])).
% 0.20/0.38 tff(30,plain,(~l), inference(lemma,lemma(discharge,[]))).
% 0.20/0.38 tff(31,axiom,(l | (~m)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_3')).
% 0.20/0.38 tff(32,plain,
% 0.20/0.38 (~m),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[31, 30])).
% 0.20/0.38 tff(33,axiom,(l | (~q)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_4')).
% 0.20/0.38 tff(34,plain,
% 0.20/0.38 (~q),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[33, 30])).
% 0.20/0.38 tff(35,plain,
% 0.20/0.38 (($false | m | q) <=> (m | q)),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(36,plain,
% 0.20/0.38 ((n | m | q) <=> ($false | m | q)),
% 0.20/0.38 inference(monotonicity,[status(thm)],[19])).
% 0.20/0.38 tff(37,plain,
% 0.20/0.38 ((n | m | q) <=> (m | q)),
% 0.20/0.38 inference(transitivity,[status(thm)],[36, 35])).
% 0.20/0.38 tff(38,plain,
% 0.20/0.38 ((n | m | q) <=> (n | m | q)),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(39,plain,
% 0.20/0.38 (((m | q) | n) <=> (n | m | q)),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(40,axiom,((m | q) | n), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_2')).
% 0.20/0.38 tff(41,plain,
% 0.20/0.38 (n | m | q),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[40, 39])).
% 0.20/0.38 tff(42,plain,
% 0.20/0.38 (n | m | q),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[41, 38])).
% 0.20/0.38 tff(43,plain,
% 0.20/0.38 (n | m | q),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[42, 38])).
% 0.20/0.38 tff(44,plain,
% 0.20/0.38 (m | q),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[43, 37])).
% 0.20/0.38 tff(45,plain,
% 0.20/0.38 ($false),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[44, 34, 32])).
% 0.20/0.38 % SZS output end Proof
%------------------------------------------------------------------------------