TSTP Solution File: SYN126-1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYN126-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n017.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:17:34 EDT 2024
% Result : Unsatisfiable 262.58s 38.09s
% Output : Refutation 262.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 33 ( 11 unt; 6 typ; 0 def)
% Number of atoms : 49 ( 3 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 126 ( 20 ~; 16 |; 0 &; 90 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 45 ( 0 ^ 45 !; 0 ?; 45 :)
% Comments :
%------------------------------------------------------------------------------
thf(l4_type,type,
l4: $i > $o ).
thf(b_type,type,
b: $i ).
thf(p0_type,type,
p0: $i > $i > $o ).
thf(n2_type,type,
n2: $i > $o ).
thf(p1_type,type,
p1: $i > $i > $i > $o ).
thf(p3_type,type,
p3: $i > $i > $i > $o ).
thf(1,negated_conjecture,
~ ( l4 @ b ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
thf(370,plain,
~ ( l4 @ b ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(371,plain,
~ ( l4 @ b ),
inference(polarity_switch,[status(thm)],[370]) ).
thf(25,axiom,
! [A: $i] :
( ( p3 @ A @ A @ A )
| ~ ( n2 @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_244) ).
thf(416,plain,
! [A: $i] :
( ( p3 @ A @ A @ A )
| ~ ( n2 @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[25]) ).
thf(417,plain,
! [A: $i] :
( ( p3 @ A @ A @ A )
| ~ ( n2 @ A ) ),
inference(cnf,[status(esa)],[416]) ).
thf(301,axiom,
! [A: $i] : ( p0 @ b @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).
thf(944,plain,
! [A: $i] : ( p0 @ b @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[301]) ).
thf(151,axiom,
! [B: $i,A: $i] :
( ( p1 @ A @ A @ A )
| ~ ( p0 @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_085) ).
thf(660,plain,
! [B: $i,A: $i] :
( ( p1 @ A @ A @ A )
| ~ ( p0 @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[151]) ).
thf(661,plain,
! [B: $i,A: $i] :
( ( p1 @ A @ A @ A )
| ~ ( p0 @ B @ A ) ),
inference(cnf,[status(esa)],[660]) ).
thf(15011,plain,
! [C: $i,B: $i,A: $i] :
( ( p1 @ B @ B @ B )
| ( ( p0 @ b @ A )
!= ( p0 @ C @ B ) ) ),
inference(paramod_ordered,[status(thm)],[944,661]) ).
thf(15012,plain,
! [A: $i] : ( p1 @ A @ A @ A ),
inference(pattern_uni,[status(thm)],[15011:[bind(A,$thf( A )),bind(B,$thf( A )),bind(C,$thf( b ))]]) ).
thf(107,axiom,
! [C: $i,B: $i,A: $i] :
( ( n2 @ A )
| ~ ( p1 @ B @ C @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_137) ).
thf(575,plain,
! [C: $i,B: $i,A: $i] :
( ( n2 @ A )
| ~ ( p1 @ B @ C @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[107]) ).
thf(576,plain,
! [C: $i,B: $i,A: $i] :
( ( n2 @ A )
| ~ ( p1 @ B @ C @ A ) ),
inference(cnf,[status(esa)],[575]) ).
thf(15040,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( n2 @ B )
| ( ( p1 @ A @ A @ A )
!= ( p1 @ C @ D @ B ) ) ),
inference(paramod_ordered,[status(thm)],[15012,576]) ).
thf(15041,plain,
! [A: $i] : ( n2 @ A ),
inference(pattern_uni,[status(thm)],[15040:[bind(A,$thf( A )),bind(B,$thf( A )),bind(C,$thf( A )),bind(D,$thf( A ))]]) ).
thf(15050,plain,
! [A: $i] :
( ( p3 @ A @ A @ A )
| ~ $true ),
inference(rewrite,[status(thm)],[417,15041]) ).
thf(15051,plain,
! [A: $i] : ( p3 @ A @ A @ A ),
inference(simp,[status(thm)],[15050]) ).
thf(325,axiom,
! [C: $i,B: $i,A: $i] :
( ( l4 @ A )
| ~ ( p3 @ B @ C @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_277) ).
thf(989,plain,
! [C: $i,B: $i,A: $i] :
( ( l4 @ A )
| ~ ( p3 @ B @ C @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[325]) ).
thf(990,plain,
! [C: $i,B: $i,A: $i] :
( ( l4 @ A )
| ~ ( p3 @ B @ C @ A ) ),
inference(cnf,[status(esa)],[989]) ).
thf(35177,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( l4 @ B )
| ( ( p3 @ A @ A @ A )
!= ( p3 @ C @ D @ B ) ) ),
inference(paramod_ordered,[status(thm)],[15051,990]) ).
thf(35178,plain,
! [A: $i] : ( l4 @ A ),
inference(pattern_uni,[status(thm)],[35177:[bind(A,$thf( A )),bind(B,$thf( A )),bind(C,$thf( A )),bind(D,$thf( A ))]]) ).
thf(35215,plain,
~ $true,
inference(rewrite,[status(thm)],[371,35178]) ).
thf(35216,plain,
$false,
inference(simp,[status(thm)],[35215]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : SYN126-1 : TPTP v8.2.0. Released v1.1.0.
% 0.02/0.09 % Command : run_Leo-III %s %d
% 0.08/0.27 % Computer : n017.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Mon May 20 15:21:54 EDT 2024
% 0.08/0.27 % CPUTime :
% 0.87/0.77 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.50/0.95 % [INFO] Parsing done (182ms).
% 1.50/0.96 % [INFO] Running in sequential loop mode.
% 1.93/1.16 % [INFO] nitpick registered as external prover.
% 1.93/1.17 % [INFO] Scanning for conjecture ...
% 2.32/1.25 % [INFO] Found a conjecture (or negated_conjecture) and 368 axioms. Running axiom selection ...
% 2.72/1.33 % [INFO] Axiom selection finished. Selected 368 axioms (removed 0 axioms).
% 3.02/1.44 % [INFO] Problem is propositional (TPTP CNF).
% 3.02/1.45 % [INFO] Type checking passed.
% 3.02/1.45 % [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 ...
% 262.58/38.08 % [INFO] Killing All external provers ...
% 262.58/38.09 % Time passed: 37651ms (effective reasoning time: 37122ms)
% 262.58/38.09 % Axioms used in derivation (5): rule_085, rule_137, rule_277, axiom_14, rule_244
% 262.58/38.09 % No. of inferences in proof: 27
% 262.58/38.09 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 37651 ms resp. 37122 ms w/o parsing
% 262.58/38.10 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 262.58/38.10 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------