TSTP Solution File: SEV433^1 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV433^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n032.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 16:00:15 EDT 2024
% Result : Theorem 5.33s 2.49s
% Output : Refutation 5.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of formulae : 43 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 113 ( 50 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 150 ( 52 ~; 38 |; 0 &; 58 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 34 ( 0 ^ 34 !; 0 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(f_type,type,
f: $i > $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( ( f @ A )
= ( f @ B ) )
=> ( A = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',finj) ).
thf(12,plain,
! [A: $i,B: $i] :
( ( ( f @ A )
= ( f @ B ) )
=> ( A = B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(13,plain,
! [B: $i,A: $i] :
( ( ( f @ A )
!= ( f @ B ) )
| ( A = B ) ),
inference(cnf,[status(esa)],[12]) ).
thf(14,plain,
! [B: $i,A: $i] :
( ( ( f @ A )
!= ( f @ B ) )
| ( A = B ) ),
inference(lifteq,[status(thm)],[13]) ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( A = B )
| ( A = C )
| ( B = C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less3) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( A = B )
| ( A = C )
| ( B = C ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,plain,
~ ! [A: $i,B: $i,C: $i] :
( ( A = B )
| ( A = C )
| ( B = C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
~ ! [A: $i,B: $i] :
( ( A = B )
| ! [C: $i] :
( ( A = C )
| ( B = C ) ) ),
inference(miniscope,[status(thm)],[4]) ).
thf(6,plain,
sk2 != sk3,
inference(cnf,[status(esa)],[5]) ).
thf(9,plain,
sk3 != sk2,
inference(lifteq,[status(thm)],[6]) ).
thf(24,plain,
! [B: $i,A: $i] :
( ( ( f @ A )
!= ( f @ B ) )
| ( B != sk2 )
| ( A != sk3 ) ),
inference(paramod_ordered,[status(thm)],[14,9]) ).
thf(25,plain,
! [A: $i] :
( ( ( f @ sk3 )
!= ( f @ A ) )
| ( A != sk2 ) ),
inference(pattern_uni,[status(thm)],[24:[bind(A,$thf( sk3 ))]]) ).
thf(40,plain,
( ( f @ sk3 )
!= ( f @ sk2 ) ),
inference(simp,[status(thm)],[25]) ).
thf(71,plain,
( ( f @ sk3 )
| ( f @ sk2 ) ),
inference(bool_ext,[status(thm)],[40]) ).
thf(18,plain,
! [B: $i,A: $i] :
( ( A = B )
| ~ ( f @ A )
| ~ ( f @ B ) ),
inference(bool_ext,[status(thm)],[14]) ).
thf(8,plain,
sk1 != sk2,
inference(cnf,[status(esa)],[5]) ).
thf(11,plain,
sk2 != sk1,
inference(lifteq,[status(thm)],[8]) ).
thf(99,plain,
! [B: $i,A: $i] :
( ~ ( f @ A )
| ~ ( f @ B )
| ( B != sk1 )
| ( A != sk2 ) ),
inference(paramod_ordered,[status(thm)],[18,11]) ).
thf(100,plain,
! [A: $i] :
( ~ ( f @ sk2 )
| ~ ( f @ A )
| ( A != sk1 ) ),
inference(pattern_uni,[status(thm)],[99:[bind(A,$thf( sk2 ))]]) ).
thf(115,plain,
( ~ ( f @ sk2 )
| ~ ( f @ sk1 ) ),
inference(simp,[status(thm)],[100]) ).
thf(28,plain,
! [B: $i,A: $i] :
( ( ( f @ A )
!= ( f @ B ) )
| ( B != sk1 )
| ( A != sk2 ) ),
inference(paramod_ordered,[status(thm)],[14,11]) ).
thf(29,plain,
! [A: $i] :
( ( ( f @ sk2 )
!= ( f @ A ) )
| ( A != sk1 ) ),
inference(pattern_uni,[status(thm)],[28:[bind(A,$thf( sk2 ))]]) ).
thf(42,plain,
( ( f @ sk2 )
!= ( f @ sk1 ) ),
inference(simp,[status(thm)],[29]) ).
thf(127,plain,
( ( f @ sk2 )
| ( f @ sk1 ) ),
inference(bool_ext,[status(thm)],[42]) ).
thf(7,plain,
sk1 != sk3,
inference(cnf,[status(esa)],[5]) ).
thf(10,plain,
sk3 != sk1,
inference(lifteq,[status(thm)],[7]) ).
thf(20,plain,
! [B: $i,A: $i] :
( ( ( f @ A )
!= ( f @ B ) )
| ( B != sk1 )
| ( A != sk3 ) ),
inference(paramod_ordered,[status(thm)],[14,10]) ).
thf(21,plain,
! [A: $i] :
( ( ( f @ sk3 )
!= ( f @ A ) )
| ( A != sk1 ) ),
inference(pattern_uni,[status(thm)],[20:[bind(A,$thf( sk3 ))]]) ).
thf(38,plain,
( ( f @ sk3 )
!= ( f @ sk1 ) ),
inference(simp,[status(thm)],[21]) ).
thf(46,plain,
( ( f @ sk3 )
| ( f @ sk1 ) ),
inference(bool_ext,[status(thm)],[38]) ).
thf(76,plain,
( ( f @ sk1 )
| ~ ( f @ sk2 )
| ( ( f @ sk3 )
!= ( f @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[46,40]) ).
thf(77,plain,
( ( f @ sk1 )
| ~ ( f @ sk2 ) ),
inference(pattern_uni,[status(thm)],[76:[]]) ).
thf(441,plain,
( ( f @ sk1 )
| ( ( f @ sk2 )
!= ( f @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[127,77]) ).
thf(442,plain,
f @ sk1,
inference(pattern_uni,[status(thm)],[441:[]]) ).
thf(475,plain,
( ~ ( f @ sk2 )
| ~ $true ),
inference(rewrite,[status(thm)],[115,442]) ).
thf(476,plain,
~ ( f @ sk2 ),
inference(simp,[status(thm)],[475]) ).
thf(513,plain,
( ( f @ sk3 )
| $false ),
inference(rewrite,[status(thm)],[71,476]) ).
thf(514,plain,
f @ sk3,
inference(simp,[status(thm)],[513]) ).
thf(45,plain,
( ~ ( f @ sk3 )
| ~ ( f @ sk1 ) ),
inference(bool_ext,[status(thm)],[38]) ).
thf(478,plain,
( ~ ( f @ sk3 )
| ~ $true ),
inference(rewrite,[status(thm)],[45,442]) ).
thf(479,plain,
~ ( f @ sk3 ),
inference(simp,[status(thm)],[478]) ).
thf(561,plain,
$false,
inference(rewrite,[status(thm)],[514,479]) ).
thf(562,plain,
$false,
inference(simp,[status(thm)],[561]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEV433^1 : TPTP v8.2.0. Released v5.2.0.
% 0.00/0.09 % Command : run_Leo-III %s %d SAT
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Fri Jun 21 19:24:25 EDT 2024
% 0.08/0.29 % CPUTime :
% 0.96/0.91 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.22/1.07 % [INFO] Parsing done (151ms).
% 1.22/1.08 % [INFO] Running in sequential loop mode.
% 1.75/1.39 % [INFO] nitpick registered as external prover.
% 1.75/1.39 % [INFO] Scanning for conjecture ...
% 1.75/1.45 % [INFO] Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ...
% 1.91/1.47 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 1.91/1.47 % [INFO] Problem is higher-order (TPTP THF).
% 1.91/1.48 % [INFO] Type checking passed.
% 1.97/1.48 % [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.33/2.48 % [INFO] Killing All external provers ...
% 5.33/2.49 % Time passed: 2031ms (effective reasoning time: 1401ms)
% 5.33/2.49 % 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.33/2.49 % Axioms used in derivation (1): finj
% 5.33/2.49 % No. of inferences in proof: 43
% 5.33/2.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2031 ms resp. 1401 ms w/o parsing
% 5.33/2.53 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.33/2.53 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------