TSTP Solution File: SEU474^1 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEU474^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n027.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 : Mon Jun 24 15:31:25 EDT 2024
% Result : Theorem 3.05s 1.64s
% Output : Refutation 3.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 13 unt; 0 typ; 2 def)
% Number of atoms : 90 ( 41 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 166 ( 18 ~; 54 |; 0 &; 94 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 21 ( 18 ^ 3 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(rc_type,type,
rc: ( $i > $i > $o ) > $i > $i > $o ).
thf(rc_def,definition,
( rc
= ( ^ [A: $i > $i > $o,B: $i,C: $i] :
( ( B = C )
| ( A @ B @ C ) ) ) ) ).
thf(sc_type,type,
sc: ( $i > $i > $o ) > $i > $i > $o ).
thf(sc_def,definition,
( sc
= ( ^ [A: $i > $i > $o,B: $i,C: $i] :
( ( A @ C @ B )
| ( A @ B @ C ) ) ) ) ).
thf(sk1_type,type,
sk1: $i > $i > $o ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(1,conjecture,
! [A: $i > $i > $o] :
( ( sc @ ( rc @ A ) )
= ( rc @ ( sc @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composing_symmetric_closure_and_reflexive_closure) ).
thf(2,negated_conjecture,
~ ! [A: $i > $i > $o] :
( ( sc @ ( rc @ A ) )
= ( rc @ ( sc @ A ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $i > $o] :
( ( ^ [B: $i,C: $i] :
( ( C = B )
| ( A @ C @ B )
| ( B = C )
| ( A @ B @ C ) ) )
= ( ^ [B: $i,C: $i] :
( ( B = C )
| ( A @ C @ B )
| ( A @ B @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: $i,B: $i] :
( ( B = A )
| ( sk1 @ B @ A )
| ( A = B )
| ( sk1 @ A @ B ) ) )
!= ( ^ [A: $i,B: $i] :
( ( A = B )
| ( sk1 @ B @ A )
| ( sk1 @ A @ B ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ^ [A: $i,B: $i] :
( ( A = B )
| ( sk1 @ B @ A )
| ( sk1 @ A @ B ) ) )
!= ( ^ [A: $i,B: $i] :
( ( B = A )
| ( sk1 @ B @ A )
| ( A = B )
| ( sk1 @ A @ B ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(7,plain,
( ( ( sk2 = sk3 )
| ( sk1 @ sk3 @ sk2 )
| ( sk1 @ sk2 @ sk3 ) )
!= ( ( sk3 = sk2 )
| ( sk1 @ sk3 @ sk2 )
| ( sk2 = sk3 )
| ( sk1 @ sk2 @ sk3 ) ) ),
inference(func_ext,[status(esa)],[5]) ).
thf(10,plain,
( ( sk2 = sk3 )
| ( sk1 @ sk3 @ sk2 )
| ( sk1 @ sk2 @ sk3 )
| ( sk3 = sk2 )
| ( sk1 @ sk3 @ sk2 )
| ( sk2 = sk3 )
| ( sk1 @ sk2 @ sk3 ) ),
inference(bool_ext,[status(thm)],[7]) ).
thf(30,plain,
( ( sk3 = sk2 )
| ( sk1 @ sk3 @ sk2 )
| ( sk2 = sk3 )
| ( sk1 @ sk2 @ sk3 )
| ( sk2 = sk3 )
| ( sk1 @ sk3 @ sk2 )
| ( sk1 @ sk2 @ sk3 ) ),
inference(cnf,[status(esa)],[10]) ).
thf(31,plain,
( ( sk3 = sk2 )
| ( sk3 = sk2 )
| ( sk3 = sk2 )
| ( sk1 @ sk3 @ sk2 )
| ( sk1 @ sk2 @ sk3 )
| ( sk1 @ sk3 @ sk2 )
| ( sk1 @ sk2 @ sk3 ) ),
inference(lifteq,[status(thm)],[30]) ).
thf(32,plain,
( ( sk3 = sk2 )
| ( sk1 @ sk3 @ sk2 )
| ( sk1 @ sk2 @ sk3 ) ),
inference(simp,[status(thm)],[31]) ).
thf(9,plain,
( ~ ( ( sk2 = sk3 )
| ( sk1 @ sk3 @ sk2 )
| ( sk1 @ sk2 @ sk3 ) )
| ~ ( ( sk3 = sk2 )
| ( sk1 @ sk3 @ sk2 )
| ( sk2 = sk3 )
| ( sk1 @ sk2 @ sk3 ) ) ),
inference(bool_ext,[status(thm)],[7]) ).
thf(12,plain,
( ~ ( sk1 @ sk2 @ sk3 )
| ~ ( sk1 @ sk2 @ sk3 ) ),
inference(cnf,[status(esa)],[9]) ).
thf(24,plain,
~ ( sk1 @ sk2 @ sk3 ),
inference(simp,[status(thm)],[12]) ).
thf(18,plain,
( ~ ( sk1 @ sk3 @ sk2 )
| ~ ( sk1 @ sk3 @ sk2 ) ),
inference(cnf,[status(esa)],[9]) ).
thf(25,plain,
~ ( sk1 @ sk3 @ sk2 ),
inference(simp,[status(thm)],[18]) ).
thf(35,plain,
( ( sk3 = sk2 )
| $false
| $false ),
inference(rewrite,[status(thm)],[32,24,25]) ).
thf(36,plain,
sk3 = sk2,
inference(simp,[status(thm)],[35]) ).
thf(14,plain,
( ( sk2 != sk3 )
| ( sk2 != sk3 ) ),
inference(cnf,[status(esa)],[9]) ).
thf(20,plain,
( ( sk3 != sk2 )
| ( sk3 != sk2 ) ),
inference(lifteq,[status(thm)],[14]) ).
thf(21,plain,
sk3 != sk2,
inference(simp,[status(thm)],[20]) ).
thf(37,plain,
$false,
inference(simplifyReflect,[status(thm)],[36,21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU474^1 : TPTP v8.2.0. Released v3.6.0.
% 0.04/0.12 % Command : run_Leo-III %s %d SAT
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 21 14:49:10 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.96/0.87 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.26/1.02 % [INFO] Parsing done (143ms).
% 1.26/1.03 % [INFO] Running in sequential loop mode.
% 1.77/1.23 % [INFO] nitpick registered as external prover.
% 1.77/1.23 % [INFO] Scanning for conjecture ...
% 2.19/1.33 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.19/1.35 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.19/1.35 % [INFO] Problem is higher-order (TPTP THF).
% 2.19/1.35 % [INFO] Type checking passed.
% 2.19/1.35 % [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 ...
% 2.79/1.64 % [INFO] Killing All external provers ...
% 3.05/1.64 % Time passed: 1099ms (effective reasoning time: 607ms)
% 3.05/1.64 % 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)>
% 3.05/1.64 % Axioms used in derivation (0):
% 3.05/1.64 % No. of inferences in proof: 21
% 3.05/1.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1099 ms resp. 607 ms w/o parsing
% 3.12/1.72 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.12/1.72 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------