↑ Up

Z3---4.15.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SYN011-1 : TPTP v9.0.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_E %s %d THM

% 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 : Sat Jun 21 05:37:57 AM UTC 2025

% Result   : Unsatisfiable 0.20s 0.37s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SYN011-1 : TPTP v9.0.0. Released v1.1.0.
% 0.04/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n002.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Fri Jun 20 12:27:46 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 0.20/0.37  % SZS status Unsatisfiable
% 0.20/0.37  % SZS output start Proof
% 0.20/0.37  tff(m_type, type, (
% 0.20/0.37     m: $o)).
% 0.20/0.37  tff(l_type, type, (
% 0.20/0.37     l: $o)).
% 0.20/0.37  tff(p_type, type, (
% 0.20/0.37     p: $o)).
% 0.20/0.37  tff(r_type, type, (
% 0.20/0.37     r: $o)).
% 0.20/0.37  tff(n_type, type, (
% 0.20/0.37     n: $o)).
% 0.20/0.37  tff(t_type, type, (
% 0.20/0.37     t: $o)).
% 0.20/0.37  tff(q_type, type, (
% 0.20/0.37     q: $o)).
% 0.20/0.37  tff(1,assumption,(l), introduced(assumption)).
% 0.20/0.37  tff(2,axiom,((~l) | (~p)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_5')).
% 0.20/0.37  tff(3,plain,
% 0.20/0.37      (~p),
% 0.20/0.37      inference(unit_resolution,[status(thm)],[2, 1])).
% 0.20/0.37  tff(4,plain,
% 0.20/0.37      (((~r) | (~l)) <=> ((~l) | (~r))),
% 0.20/0.37      inference(rewrite,[status(thm)],[])).
% 0.20/0.37  tff(5,axiom,((~r) | (~l)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_7')).
% 0.20/0.37  tff(6,plain,
% 0.20/0.37      ((~l) | (~r)),
% 0.20/0.37      inference(modus_ponens,[status(thm)],[5, 4])).
% 0.20/0.37  tff(7,plain,
% 0.20/0.37      (~r),
% 0.20/0.37      inference(unit_resolution,[status(thm)],[6, 1])).
% 0.20/0.37  tff(8,axiom,(t), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_8')).
% 0.20/0.37  tff(9,axiom,((~n) | (~t)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_1')).
% 0.20/0.38  tff(10,plain,
% 0.20/0.38      (~n),
% 0.20/0.38      inference(unit_resolution,[status(thm)],[9, 8])).
% 0.20/0.38  tff(11,plain,
% 0.20/0.38      (((p | r) | n) <=> (n | p | r)),
% 0.20/0.38      inference(rewrite,[status(thm)],[])).
% 0.20/0.38  tff(12,plain,
% 0.20/0.38      ((r | p) <=> (p | r)),
% 0.20/0.38      inference(rewrite,[status(thm)],[])).
% 0.20/0.38  tff(13,plain,
% 0.20/0.38      (((r | p) | n) <=> ((p | r) | n)),
% 0.20/0.38      inference(monotonicity,[status(thm)],[12])).
% 0.20/0.38  tff(14,plain,
% 0.20/0.38      (((r | p) | n) <=> (n | p | r)),
% 0.20/0.38      inference(transitivity,[status(thm)],[13, 11])).
% 0.20/0.38  tff(15,axiom,((r | p) | n), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_6')).
% 0.20/0.38  tff(16,plain,
% 0.20/0.38      (n | p | r),
% 0.20/0.38      inference(modus_ponens,[status(thm)],[15, 14])).
% 0.20/0.38  tff(17,plain,
% 0.20/0.38      (p | r),
% 0.20/0.38      inference(unit_resolution,[status(thm)],[16, 10])).
% 0.20/0.38  tff(18,plain,
% 0.20/0.38      ($false),
% 0.20/0.38      inference(unit_resolution,[status(thm)],[17, 7, 3])).
% 0.20/0.38  tff(19,plain,(~l), inference(lemma,lemma(discharge,[]))).
% 0.20/0.38  tff(20,axiom,(l | (~m)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_3')).
% 0.20/0.38  tff(21,plain,
% 0.20/0.38      (~m),
% 0.20/0.38      inference(unit_resolution,[status(thm)],[20, 19])).
% 0.20/0.38  tff(22,axiom,(l | (~q)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_4')).
% 0.20/0.38  tff(23,plain,
% 0.20/0.38      (~q),
% 0.20/0.38      inference(unit_resolution,[status(thm)],[22, 19])).
% 0.20/0.38  tff(24,plain,
% 0.20/0.38      ((n | m | q) <=> (n | m | q)),
% 0.20/0.38      inference(rewrite,[status(thm)],[])).
% 0.20/0.38  tff(25,plain,
% 0.20/0.38      (((m | q) | n) <=> (n | m | q)),
% 0.20/0.38      inference(rewrite,[status(thm)],[])).
% 0.20/0.38  tff(26,axiom,((m | q) | n), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_2')).
% 0.20/0.38  tff(27,plain,
% 0.20/0.38      (n | m | q),
% 0.20/0.38      inference(modus_ponens,[status(thm)],[26, 25])).
% 0.20/0.38  tff(28,plain,
% 0.20/0.38      (n | m | q),
% 0.20/0.38      inference(modus_ponens,[status(thm)],[27, 24])).
% 0.20/0.38  tff(29,plain,
% 0.20/0.38      (n | m | q),
% 0.20/0.38      inference(modus_ponens,[status(thm)],[28, 24])).
% 0.20/0.38  tff(30,plain,
% 0.20/0.38      (n | m | q),
% 0.20/0.38      inference(modus_ponens,[status(thm)],[29, 24])).
% 0.20/0.38  tff(31,plain,
% 0.20/0.38      (m | q),
% 0.20/0.38      inference(unit_resolution,[status(thm)],[30, 10])).
% 0.20/0.38  tff(32,plain,
% 0.20/0.38      ($false),
% 0.20/0.38      inference(unit_resolution,[status(thm)],[31, 23, 21])).
% 0.20/0.38  % SZS output end Proof
% 0.20/0.38  % E exiting
%------------------------------------------------------------------------------