TSTP Solution File: SYO091^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYO091^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n021.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 May 21 08:59:16 EDT 2024
% Result : Theorem 5.25s 2.15s
% Output : Refutation 5.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 4
% Syntax : Number of formulae : 55 ( 12 unt; 3 typ; 0 def)
% Number of atoms : 305 ( 85 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 197 ( 96 ~; 101 |; 0 &; 0 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 9 ( 0 ^ 9 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
thf(sk1_type,type,
sk1: $o ).
thf(sk2_type,type,
sk2: $o ).
thf(sk3_type,type,
sk3: $o ).
thf(1,conjecture,
! [A: $o,B: $o,C: $o] :
( ( ( A = B )
= C )
= ( A
= ( B = C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM50Q) ).
thf(2,negated_conjecture,
~ ! [A: $o,B: $o,C: $o] :
( ( ( A = B )
= C )
= ( A
= ( B = C ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $o,B: $o,C: $o] :
( ( ( A = B )
= C )
= ( A
= ( B = C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ( sk1 = sk2 )
= sk3 )
!= ( sk1
= ( sk2 = sk3 ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( sk1
= ( sk2 = sk3 ) )
!= ( ( sk1 = sk2 )
= sk3 ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(7,plain,
( ( sk1
!= ( sk2 = sk3 ) )
| ( ( sk1 = sk2 )
!= sk3 ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(9,plain,
( ( sk1
!= ( sk2 = sk3 ) )
| ( sk3
!= ( sk1 = sk2 ) ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(21,plain,
( ~ sk1
| ( sk2 != sk3 )
| sk3
| ( sk1 = sk2 ) ),
inference(bool_ext,[status(thm)],[9]) ).
thf(25,plain,
( ( sk3 != sk2 )
| ( sk2 = sk1 )
| ~ sk1
| sk3 ),
inference(lifteq,[status(thm)],[21]) ).
thf(281,plain,
( ~ sk1
| sk3
| sk3
| sk2
| sk2
| ~ sk1 ),
inference(bool_ext,[status(thm)],[25]) ).
thf(292,plain,
( ~ sk1
| sk3
| sk2 ),
inference(simp,[status(thm)],[281]) ).
thf(293,plain,
( ~ sk1
| sk2
| ( ( ( sk1 = sk2 )
= sk3 )
!= ( sk1 = sk2 ) )
| ( sk3 != sk3 ) ),
inference(paramod_ordered,[status(thm)],[292,5]) ).
thf(294,plain,
( ~ sk1
| sk2
| ( ( ( sk1 = sk2 )
= sk3 )
!= ( sk1 = sk2 ) ) ),
inference(pattern_uni,[status(thm)],[293:[]]) ).
thf(484,plain,
( ~ sk1
| sk2
| ( sk3 != sk3 ) ),
inference(paramod_ordered,[status(thm)],[292,294]) ).
thf(485,plain,
( ~ sk1
| sk2 ),
inference(pattern_uni,[status(thm)],[484:[]]) ).
thf(6,plain,
( ( ( sk1 = sk2 )
!= sk1 )
| ( ( sk2 = sk3 )
!= sk3 ) ),
inference(simp,[status(thm)],[5]) ).
thf(13,plain,
( ( sk1 != sk2 )
| ~ sk1
| ( sk2 = sk3 )
| sk3 ),
inference(bool_ext,[status(thm)],[6]) ).
thf(17,plain,
( ( sk2 != sk1 )
| ( sk3 = sk2 )
| ~ sk1
| sk3 ),
inference(lifteq,[status(thm)],[13]) ).
thf(122,plain,
( ~ sk1
| sk3
| ~ sk2
| ~ sk1
| sk3
| ~ sk2 ),
inference(bool_ext,[status(thm)],[17]) ).
thf(155,plain,
( ~ sk1
| sk3
| ~ sk2 ),
inference(simp,[status(thm)],[122]) ).
thf(11,plain,
( ( sk1 != sk2 )
| ~ sk1
| ( sk2 != sk3 )
| ~ sk3 ),
inference(bool_ext,[status(thm)],[6]) ).
thf(15,plain,
( ( sk2 != sk1 )
| ( sk3 != sk2 )
| ~ sk1
| ~ sk3 ),
inference(lifteq,[status(thm)],[11]) ).
thf(53,plain,
( ~ sk1
| ~ sk3
| ~ sk2
| ~ sk1
| ~ sk3
| ~ sk2 ),
inference(bool_ext,[status(thm)],[15]) ).
thf(60,plain,
( ~ sk1
| ~ sk3
| ~ sk2 ),
inference(simp,[status(thm)],[53]) ).
thf(186,plain,
( ~ sk1
| ~ sk2
| ( sk3 != sk3 ) ),
inference(paramod_ordered,[status(thm)],[155,60]) ).
thf(187,plain,
( ~ sk1
| ~ sk2 ),
inference(pattern_uni,[status(thm)],[186:[]]) ).
thf(513,plain,
( ~ sk1
| ( sk2 != sk2 ) ),
inference(paramod_ordered,[status(thm)],[485,187]) ).
thf(514,plain,
~ sk1,
inference(pattern_uni,[status(thm)],[513:[]]) ).
thf(534,plain,
( ( $false
= ( sk2 = sk3 ) )
!= ( ( $false = sk2 )
= sk3 ) ),
inference(rewrite,[status(thm)],[5,514]) ).
thf(535,plain,
( ( sk2 != sk3 )
!= ( ~ sk2 = sk3 ) ),
inference(simp,[status(thm)],[534]) ).
thf(14,plain,
( ( sk1 = sk2 )
| sk1
| ( sk2 = sk3 )
| sk3 ),
inference(bool_ext,[status(thm)],[6]) ).
thf(18,plain,
( ( sk2 = sk1 )
| ( sk3 = sk2 )
| sk1
| sk3 ),
inference(lifteq,[status(thm)],[14]) ).
thf(67,plain,
( sk1
| sk3
| ~ sk2
| sk1
| sk3
| ~ sk2 ),
inference(bool_ext,[status(thm)],[18]) ).
thf(85,plain,
( sk1
| sk3
| ~ sk2 ),
inference(simp,[status(thm)],[67]) ).
thf(12,plain,
( ( sk1 = sk2 )
| sk1
| ( sk2 != sk3 )
| ~ sk3 ),
inference(bool_ext,[status(thm)],[6]) ).
thf(16,plain,
( ( sk2 = sk1 )
| ( sk3 != sk2 )
| sk1
| ~ sk3 ),
inference(lifteq,[status(thm)],[12]) ).
thf(107,plain,
( sk1
| ~ sk3
| ~ sk2
| sk1
| ~ sk3
| ~ sk2 ),
inference(bool_ext,[status(thm)],[16]) ).
thf(119,plain,
( sk1
| ~ sk3
| ~ sk2 ),
inference(simp,[status(thm)],[107]) ).
thf(160,plain,
( sk1
| ~ sk2
| ( sk3 != sk3 ) ),
inference(paramod_ordered,[status(thm)],[85,119]) ).
thf(161,plain,
( sk1
| ~ sk2 ),
inference(pattern_uni,[status(thm)],[160:[]]) ).
thf(546,plain,
( $false
| ~ sk2 ),
inference(rewrite,[status(thm)],[161,514]) ).
thf(547,plain,
~ sk2,
inference(simp,[status(thm)],[546]) ).
thf(20,plain,
( sk1
| ( sk2 = sk3 )
| ~ sk3
| ( sk1 != sk2 ) ),
inference(bool_ext,[status(thm)],[9]) ).
thf(24,plain,
( ( sk3 = sk2 )
| ( sk2 != sk1 )
| sk1
| ~ sk3 ),
inference(lifteq,[status(thm)],[20]) ).
thf(199,plain,
( sk1
| ~ sk3
| ~ sk3
| sk2
| sk2
| sk1 ),
inference(bool_ext,[status(thm)],[24]) ).
thf(205,plain,
( sk1
| ~ sk3
| sk2 ),
inference(simp,[status(thm)],[199]) ).
thf(544,plain,
( $false
| ~ sk3
| sk2 ),
inference(rewrite,[status(thm)],[205,514]) ).
thf(545,plain,
( ~ sk3
| sk2 ),
inference(simp,[status(thm)],[544]) ).
thf(571,plain,
( ~ sk3
| $false ),
inference(rewrite,[status(thm)],[545,547]) ).
thf(572,plain,
~ sk3,
inference(simp,[status(thm)],[571]) ).
thf(577,plain,
( ( $false != $false )
!= ( ~ $false = $false ) ),
inference(rewrite,[status(thm)],[535,547,572]) ).
thf(578,plain,
$false,
inference(simp,[status(thm)],[577]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO091^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n021.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 10:52:24 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.98/0.87 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.06/0.98 % [INFO] Parsing done (106ms).
% 1.06/0.99 % [INFO] Running in sequential loop mode.
% 1.63/1.20 % [INFO] nitpick registered as external prover.
% 1.63/1.21 % [INFO] Scanning for conjecture ...
% 1.72/1.25 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.72/1.27 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.72/1.27 % [INFO] Problem is higher-order (TPTP THF).
% 1.72/1.27 % [INFO] Type checking passed.
% 1.72/1.28 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 5.25/2.15 % [INFO] Killing All external provers ...
% 5.25/2.15 % Time passed: 1635ms (effective reasoning time: 1154ms)
% 5.25/2.15 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 5.25/2.15 % Axioms used in derivation (0):
% 5.25/2.15 % No. of inferences in proof: 52
% 5.25/2.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1635 ms resp. 1154 ms w/o parsing
% 5.25/2.18 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.25/2.18 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------