TSTP Solution File: NUM430+3 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : NUM430+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n025.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 01:34:45 EDT 2024
% Result : Theorem 12.91s 3.22s
% Output : Refutation 12.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 24 ( 5 unt; 11 typ; 0 def)
% Number of atoms : 35 ( 14 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 138 ( 9 ~; 3 |; 17 &; 109 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 10 ( 0 ^ 3 !; 7 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(aInteger0_type,type,
aInteger0: $i > $o ).
thf(aDivisorOf0_type,type,
aDivisorOf0: $i > $i > $o ).
thf(sdtasdt0_type,type,
sdtasdt0: $i > $i > $i ).
thf(sdteqdtlpzmzozddtrp0_type,type,
sdteqdtlpzmzozddtrp0: $i > $i > $i > $o ).
thf(sdtpldt0_type,type,
sdtpldt0: $i > $i > $i ).
thf(smndt0_type,type,
smndt0: $i > $i ).
thf(xq_type,type,
xq: $i ).
thf(xb_type,type,
xb: $i ).
thf(xc_type,type,
xc: $i ).
thf(xa_type,type,
xa: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(14,axiom,
( ? [A: $i] :
( ( aInteger0 @ A )
& ( ( sdtasdt0 @ xq @ A )
= ( sdtpldt0 @ xa @ ( smndt0 @ xb ) ) ) )
& ( aDivisorOf0 @ xq @ ( sdtpldt0 @ xa @ ( smndt0 @ xb ) ) )
& ( sdteqdtlpzmzozddtrp0 @ xa @ xb @ xq )
& ? [A: $i] :
( ( aInteger0 @ A )
& ( ( sdtasdt0 @ xq @ A )
= ( sdtpldt0 @ xb @ ( smndt0 @ xc ) ) ) )
& ( aDivisorOf0 @ xq @ ( sdtpldt0 @ xb @ ( smndt0 @ xc ) ) )
& ( sdteqdtlpzmzozddtrp0 @ xb @ xc @ xq ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__853) ).
thf(77,plain,
( ? [A: $i] :
( ( aInteger0 @ A )
& ( ( sdtasdt0 @ xq @ A )
= ( sdtpldt0 @ xa @ ( smndt0 @ xb ) ) ) )
& ( aDivisorOf0 @ xq @ ( sdtpldt0 @ xa @ ( smndt0 @ xb ) ) )
& ( sdteqdtlpzmzozddtrp0 @ xa @ xb @ xq )
& ? [A: $i] :
( ( aInteger0 @ A )
& ( ( sdtasdt0 @ xq @ A )
= ( sdtpldt0 @ xb @ ( smndt0 @ xc ) ) ) )
& ( aDivisorOf0 @ xq @ ( sdtpldt0 @ xb @ ( smndt0 @ xc ) ) )
& ( sdteqdtlpzmzozddtrp0 @ xb @ xc @ xq ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(82,plain,
( ( sdtasdt0 @ xq @ sk3 )
= ( sdtpldt0 @ xb @ ( smndt0 @ xc ) ) ),
inference(cnf,[status(esa)],[77]) ).
thf(87,plain,
( ( sdtpldt0 @ xb @ ( smndt0 @ xc ) )
= ( sdtasdt0 @ xq @ sk3 ) ),
inference(lifteq,[status(thm)],[82]) ).
thf(81,plain,
aInteger0 @ sk3,
inference(cnf,[status(esa)],[77]) ).
thf(1,conjecture,
? [A: $i] :
( ( aInteger0 @ A )
& ( ( sdtasdt0 @ xq @ A )
= ( sdtpldt0 @ xb @ ( smndt0 @ xc ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
thf(2,negated_conjecture,
~ ? [A: $i] :
( ( aInteger0 @ A )
& ( ( sdtasdt0 @ xq @ A )
= ( sdtpldt0 @ xb @ ( smndt0 @ xc ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(27,plain,
~ ? [A: $i] :
( ( aInteger0 @ A )
& ( ( sdtasdt0 @ xq @ A )
= ( sdtpldt0 @ xb @ ( smndt0 @ xc ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(28,plain,
! [A: $i] :
( ~ ( aInteger0 @ A )
| ( ( sdtasdt0 @ xq @ A )
!= ( sdtpldt0 @ xb @ ( smndt0 @ xc ) ) ) ),
inference(cnf,[status(esa)],[27]) ).
thf(29,plain,
! [A: $i] :
( ( ( sdtasdt0 @ xq @ A )
!= ( sdtpldt0 @ xb @ ( smndt0 @ xc ) ) )
| ~ ( aInteger0 @ A ) ),
inference(lifteq,[status(thm)],[28]) ).
thf(162,plain,
! [A: $i] :
( ( ( sdtasdt0 @ xq @ A )
!= ( sdtpldt0 @ xb @ ( smndt0 @ xc ) ) )
| ( ( aInteger0 @ sk3 )
!= ( aInteger0 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[81,29]) ).
thf(163,plain,
( ( sdtpldt0 @ xb @ ( smndt0 @ xc ) )
!= ( sdtasdt0 @ xq @ sk3 ) ),
inference(pattern_uni,[status(thm)],[162:[bind(A,$thf( sk3 ))]]) ).
thf(2630,plain,
$false,
inference(simplifyReflect,[status(thm)],[87,163]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM430+3 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n025.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon May 20 04:45:24 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.94/0.86 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.25/0.98 % [INFO] Parsing done (117ms).
% 1.25/0.99 % [INFO] Running in sequential loop mode.
% 1.68/1.19 % [INFO] nitpick registered as external prover.
% 1.68/1.19 % [INFO] Scanning for conjecture ...
% 1.90/1.24 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.91/1.25 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.91/1.26 % [INFO] Found a conjecture (or negated_conjecture) and 24 axioms. Running axiom selection ...
% 2.08/1.31 % [INFO] Axiom selection finished. Selected 24 axioms (removed 0 axioms).
% 2.08/1.31 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.08/1.32 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.08/1.34 % [INFO] Problem is first-order (TPTP FOF).
% 2.08/1.35 % [INFO] Type checking passed.
% 2.08/1.35 % [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 ...
% 12.91/3.21 % [INFO] Killing All external provers ...
% 12.91/3.22 % Time passed: 2683ms (effective reasoning time: 2224ms)
% 12.91/3.22 % 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)>
% 12.91/3.22 % Axioms used in derivation (1): m__853
% 12.91/3.22 % No. of inferences in proof: 13
% 12.91/3.22 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2683 ms resp. 2224 ms w/o parsing
% 12.94/3.26 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 12.94/3.26 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------