TSTP Solution File: NUM769^1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : NUM769^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% 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 : Tue May 7 10:45:38 EDT 2024
% Result : Theorem 3.62s 2.23s
% Output : Refutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 25 ( 8 unt; 7 typ; 0 def)
% Number of atoms : 33 ( 2 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 125 ( 12 ~; 7 |; 0 &; 102 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 0 ^ 22 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(frac_type,type,
frac: $tType ).
thf(x_type,type,
x: frac ).
thf(y_type,type,
y: frac ).
thf(moref_type,type,
moref: frac > frac > $o ).
thf(eq_type,type,
eq: frac > frac > $o ).
thf(pf_type,type,
pf: frac > frac > frac ).
thf(mf_type,type,
mf: frac > frac > frac ).
thf(5,axiom,
! [A: frac,B: frac] :
( ( moref @ A @ B )
=> ( eq @ ( pf @ B @ ( mf @ A @ B ) ) @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz67c) ).
thf(10,plain,
! [A: frac,B: frac] :
( ( moref @ A @ B )
=> ( eq @ ( pf @ B @ ( mf @ A @ B ) ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(11,plain,
! [B: frac,A: frac] :
( ~ ( moref @ A @ B )
| ( eq @ ( pf @ B @ ( mf @ A @ B ) ) @ A ) ),
inference(cnf,[status(esa)],[10]) ).
thf(4,axiom,
! [A: frac,B: frac] :
( ( eq @ A @ B )
=> ( eq @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz38) ).
thf(8,plain,
! [A: frac,B: frac] :
( ( eq @ A @ B )
=> ( eq @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(9,plain,
! [B: frac,A: frac] :
( ~ ( eq @ A @ B )
| ( eq @ B @ A ) ),
inference(cnf,[status(esa)],[8]) ).
thf(18,plain,
! [D: frac,C: frac,B: frac,A: frac] :
( ~ ( moref @ A @ B )
| ( eq @ D @ C )
| ( ( eq @ ( pf @ B @ ( mf @ A @ B ) ) @ A )
!= ( eq @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[11,9]) ).
thf(19,plain,
! [B: frac,A: frac] :
( ~ ( moref @ A @ B )
| ( eq @ A @ ( pf @ B @ ( mf @ A @ B ) ) ) ),
inference(pattern_uni,[status(thm)],[18:[bind(A,$thf( G )),bind(B,$thf( H )),bind(C,$thf( pf @ H @ ( mf @ G @ H ) )),bind(D,$thf( G ))]]) ).
thf(21,plain,
! [B: frac,A: frac] :
( ~ ( moref @ A @ B )
| ( eq @ A @ ( pf @ B @ ( mf @ A @ B ) ) ) ),
inference(simp,[status(thm)],[19]) ).
thf(1,conjecture,
eq @ x @ ( pf @ y @ ( mf @ x @ y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz67d) ).
thf(2,negated_conjecture,
~ ( eq @ x @ ( pf @ y @ ( mf @ x @ y ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
~ ( eq @ x @ ( pf @ y @ ( mf @ x @ y ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(35,plain,
! [B: frac,A: frac] :
( ~ ( moref @ A @ B )
| ( ( eq @ A @ ( pf @ B @ ( mf @ A @ B ) ) )
!= ( eq @ x @ ( pf @ y @ ( mf @ x @ y ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[21,6]) ).
thf(36,plain,
~ ( moref @ x @ y ),
inference(pattern_uni,[status(thm)],[35:[bind(A,$thf( x )),bind(B,$thf( y ))]]) ).
thf(3,axiom,
moref @ x @ y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(7,plain,
moref @ x @ y,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(42,plain,
~ $true,
inference(rewrite,[status(thm)],[36,7]) ).
thf(43,plain,
$false,
inference(simp,[status(thm)],[42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : NUM769^1 : TPTP v8.1.2. Released v3.7.0.
% 0.05/0.13 % Command : run_Leo-III %s %d
% 0.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % 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 : Mon May 6 20:00:40 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.87/0.92 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.24/1.07 % [INFO] Parsing done (148ms).
% 1.28/1.08 % [INFO] Running in sequential loop mode.
% 1.78/1.43 % [INFO] nitpick registered as external prover.
% 1.78/1.44 % [INFO] Scanning for conjecture ...
% 1.87/1.51 % [INFO] Found a conjecture and 3 axioms. Running axiom selection ...
% 1.87/1.54 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 2.00/1.56 % [INFO] Problem is higher-order (TPTP THF).
% 2.00/1.56 % [INFO] Type checking passed.
% 2.00/1.57 % [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 ...
% 3.62/2.22 % [INFO] Killing All external provers ...
% 3.62/2.23 % Time passed: 1738ms (effective reasoning time: 1135ms)
% 3.62/2.23 % 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.62/2.23 % Axioms used in derivation (3): satz67c, satz38, m
% 3.62/2.23 % No. of inferences in proof: 18
% 3.62/2.23 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1738 ms resp. 1135 ms w/o parsing
% 3.62/2.27 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.62/2.27 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------