TSTP Solution File: SYO506_8 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYO506_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n007.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 09:00:46 EDT 2024
% Result : Theorem 2.49s 1.61s
% Output : Refutation 2.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 12 unt; 3 typ; 0 def)
% Number of atoms : 49 ( 35 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 90 ( 19 ~; 11 |; 0 &; 60 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 4 con; 0-3 aty)
% Number of variables : 32 ( 0 ^ 32 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(c_type,type,
c: $o > $i > $i > $i ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(1,conjecture,
( ! [A: $i,B: $i] :
( ( c @ ( A = B ) @ A @ B )
= B )
| ~ ! [A: $i,B: $i] :
( ( c @ $true @ A @ B )
= A )
| ~ ! [A: $i,B: $i] :
( ( c @ $false @ A @ B )
= B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',claim) ).
thf(2,negated_conjecture,
~ ( ! [A: $i,B: $i] :
( ( c @ ( A = B ) @ A @ B )
= B )
| ~ ! [A: $i,B: $i] :
( ( c @ $true @ A @ B )
= A )
| ~ ! [A: $i,B: $i] :
( ( c @ $false @ A @ B )
= B ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i] :
( ( c @ ( A = B ) @ A @ B )
= B )
| ~ ! [A: $i,B: $i] :
( ( c @ $true @ A @ B )
= A )
| ~ ! [A: $i,B: $i] :
( ( c @ $false @ A @ B )
= B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
( ( c @ ( sk1 = sk2 ) @ sk1 @ sk2 )
!= sk2 ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
( ( c @ ( sk1 = sk2 ) @ sk1 @ sk2 )
!= sk2 ),
inference(lifteq,[status(thm)],[6]) ).
thf(4,plain,
! [B: $i,A: $i] :
( ( c @ $false @ A @ B )
= B ),
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
! [B: $i,A: $i] :
( ( c @ $false @ A @ B )
= B ),
inference(lifteq,[status(thm)],[4]) ).
thf(8,plain,
! [B: $i,A: $i] :
( ( c @ $false @ A @ B )
= B ),
inference(simp,[status(thm)],[7]) ).
thf(11,plain,
! [B: $i,A: $i] :
( ( B != sk2 )
| ( ( c @ $false @ A @ B )
!= ( c @ ( sk1 = sk2 ) @ sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[8,10]) ).
thf(13,plain,
! [A: $i] :
( ( sk1 = sk2 )
| ( A != sk1 )
| ( sk2 != sk2 ) ),
inference(simp,[status(thm)],[11]) ).
thf(14,plain,
! [A: $i] :
( ( sk2 = sk1 )
| ( A != sk1 )
| ( sk2 != sk2 ) ),
inference(lifteq,[status(thm)],[13]) ).
thf(15,plain,
sk2 = sk1,
inference(simp,[status(thm)],[14]) ).
thf(16,plain,
( ( c @ ( sk1 = sk1 ) @ sk1 @ sk1 )
!= sk1 ),
inference(rewrite,[status(thm)],[10,15]) ).
thf(17,plain,
( ( c @ $true @ sk1 @ sk1 )
!= sk1 ),
inference(simp,[status(thm)],[16]) ).
thf(5,plain,
! [B: $i,A: $i] :
( ( c @ $true @ A @ B )
= A ),
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
! [B: $i,A: $i] :
( ( c @ $true @ A @ B )
= A ),
inference(lifteq,[status(thm)],[5]) ).
thf(29,plain,
sk1 != sk1,
inference(rewrite,[status(thm)],[17,9]) ).
thf(30,plain,
$false,
inference(simp,[status(thm)],[29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO506_8 : TPTP v8.2.0. Released v8.0.0.
% 0.12/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n007.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 09:33:39 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.82/0.85 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.18/0.95 % [INFO] Parsing done (101ms).
% 1.18/0.96 % [INFO] Running in sequential loop mode.
% 1.44/1.17 % [INFO] nitpick registered as external prover.
% 1.44/1.18 % [INFO] Scanning for conjecture ...
% 1.81/1.24 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.81/1.26 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.81/1.26 % [INFO] Problem is typed first-order (TPTP TFF).
% 1.81/1.26 % [INFO] Type checking passed.
% 1.81/1.26 % [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.49/1.56 % [INFO] Killing All external provers ...
% 2.49/1.60 % Time passed: 1043ms (effective reasoning time: 596ms)
% 2.49/1.60 % 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)>
% 2.49/1.61 % Axioms used in derivation (0):
% 2.49/1.61 % No. of inferences in proof: 18
% 2.49/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1043 ms resp. 596 ms w/o parsing
% 2.75/1.63 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.75/1.63 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------