TSTP Solution File: SYN396+1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : SYN396+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n006.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 7 11:01:50 EDT 2024
% Result : Theorem 2.77s 1.75s
% Output : Refutation 2.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 32 ( 2 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 66 ( 24 ~; 6 |; 2 &; 28 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 0 ^ 16 !; 4 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(f_type,type,
f: $i > $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(1,conjecture,
( ~ ! [A: $i] : ( f @ A )
<=> ? [A: $i] :
~ ( f @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish203) ).
thf(2,negated_conjecture,
~ ( ~ ! [A: $i] : ( f @ A )
<=> ? [A: $i] :
~ ( f @ A ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ~ ! [A: $i] : ( f @ A )
=> ? [A: $i] :
~ ( f @ A ) )
& ( ? [A: $i] :
~ ( f @ A )
=> ~ ! [A: $i] : ( f @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ( ( ~ ! [A: $i] : ( f @ A )
=> ~ ! [A: $i] : ( f @ A ) )
& ( ~ ! [A: $i] : ( f @ A )
=> ~ ! [A: $i] : ( f @ A ) ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(6,plain,
! [A: $i] :
( ~ ( f @ sk1 )
| ( f @ A ) ),
inference(cnf,[status(esa)],[4]) ).
thf(9,plain,
! [A: $i] :
( ~ ( f @ sk1 )
| ( f @ A ) ),
inference(simp,[status(thm)],[6]) ).
thf(5,plain,
( ~ ( f @ sk1 )
| ~ ( f @ sk2 ) ),
inference(cnf,[status(esa)],[4]) ).
thf(24,plain,
! [A: $i] :
( ~ ( f @ sk1 )
| ( ( f @ A )
!= ( f @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[9,5]) ).
thf(25,plain,
~ ( f @ sk1 ),
inference(pattern_uni,[status(thm)],[24:[bind(A,$thf( sk2 ))]]) ).
thf(8,plain,
! [B: $i,A: $i] :
( ( f @ A )
| ( f @ B ) ),
inference(cnf,[status(esa)],[4]) ).
thf(42,plain,
! [B: $i,A: $i] :
( ( f @ A )
| ( ( f @ B )
!= ( f @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[8,25]) ).
thf(43,plain,
! [A: $i] : ( f @ A ),
inference(pattern_uni,[status(thm)],[42:[bind(A,$thf( A )),bind(B,$thf( sk1 ))]]) ).
thf(51,plain,
~ $true,
inference(rewrite,[status(thm)],[25,43]) ).
thf(52,plain,
$false,
inference(simp,[status(thm)],[51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SYN396+1 : TPTP v8.1.2. Released v2.0.0.
% 0.05/0.11 % Command : run_Leo-III %s %d
% 0.11/0.31 % Computer : n006.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 6 21:02:24 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.86/0.77 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.02/0.89 % [INFO] Parsing done (115ms).
% 1.02/0.90 % [INFO] Running in sequential loop mode.
% 1.58/1.16 % [INFO] nitpick registered as external prover.
% 1.58/1.17 % [INFO] Scanning for conjecture ...
% 1.58/1.22 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.73/1.24 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.73/1.24 % [INFO] Problem is first-order (TPTP FOF).
% 1.73/1.25 % [INFO] Type checking passed.
% 1.73/1.25 % [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.77/1.75 % [INFO] Killing All external provers ...
% 2.77/1.75 % Time passed: 1302ms (effective reasoning time: 847ms)
% 2.77/1.75 % 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.77/1.75 % Axioms used in derivation (0):
% 2.77/1.75 % No. of inferences in proof: 14
% 2.77/1.75 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1302 ms resp. 847 ms w/o parsing
% 2.90/1.82 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.90/1.82 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------