TSTP Solution File: NUM561+2 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : NUM561+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n022.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 : Fri May 19 11:41:09 EDT 2023
% Result : Theorem 5.64s 2.46s
% Output : Refutation 5.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 16 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 21 ( 8 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 94 ( 9 ~; 6 |; 3 &; 76 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 6 ( 0 ^; 3 !; 3 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(aElementOf0_type,type,
aElementOf0: $i > $i > $o ).
thf(szDzozmdt0_type,type,
szDzozmdt0: $i > $i ).
thf(sdtlpdtrp0_type,type,
sdtlpdtrp0: $i > $i > $i ).
thf(sdtlcdtrc0_type,type,
sdtlcdtrc0: $i > $i > $i ).
thf(xF_type,type,
xF: $i ).
thf(xx_type,type,
xx: $i ).
thf(57,axiom,
aElementOf0 @ xx @ ( szDzozmdt0 @ xF ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2911_02) ).
thf(353,plain,
aElementOf0 @ xx @ ( szDzozmdt0 @ xF ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[57]) ).
thf(1,conjecture,
( ? [A: $i] :
( ( aElementOf0 @ A @ ( szDzozmdt0 @ xF ) )
& ( ( sdtlpdtrp0 @ xF @ A )
= ( sdtlpdtrp0 @ xF @ xx ) ) )
| ( aElementOf0 @ ( sdtlpdtrp0 @ xF @ xx ) @ ( sdtlcdtrc0 @ xF @ ( szDzozmdt0 @ xF ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
thf(2,negated_conjecture,
~ ( ? [A: $i] :
( ( aElementOf0 @ A @ ( szDzozmdt0 @ xF ) )
& ( ( sdtlpdtrp0 @ xF @ A )
= ( sdtlpdtrp0 @ xF @ xx ) ) )
| ( aElementOf0 @ ( sdtlpdtrp0 @ xF @ xx ) @ ( sdtlcdtrc0 @ xF @ ( szDzozmdt0 @ xF ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(73,plain,
~ ( ? [A: $i] :
( ( aElementOf0 @ A @ ( szDzozmdt0 @ xF ) )
& ( ( sdtlpdtrp0 @ xF @ A )
= ( sdtlpdtrp0 @ xF @ xx ) ) )
| ( aElementOf0 @ ( sdtlpdtrp0 @ xF @ xx ) @ ( sdtlcdtrc0 @ xF @ ( szDzozmdt0 @ xF ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(75,plain,
! [A: $i] :
( ~ ( aElementOf0 @ A @ ( szDzozmdt0 @ xF ) )
| ( ( sdtlpdtrp0 @ xF @ A )
!= ( sdtlpdtrp0 @ xF @ xx ) ) ),
inference(cnf,[status(esa)],[73]) ).
thf(76,plain,
! [A: $i] :
( ( ( sdtlpdtrp0 @ xF @ A )
!= ( sdtlpdtrp0 @ xF @ xx ) )
| ~ ( aElementOf0 @ A @ ( szDzozmdt0 @ xF ) ) ),
inference(lifteq,[status(thm)],[75]) ).
thf(483,plain,
! [A: $i] :
( ( ( sdtlpdtrp0 @ xF @ A )
!= ( sdtlpdtrp0 @ xF @ xx ) )
| ( ( aElementOf0 @ xx @ ( szDzozmdt0 @ xF ) )
!= ( aElementOf0 @ A @ ( szDzozmdt0 @ xF ) ) ) ),
inference(paramod_ordered,[status(thm)],[353,76]) ).
thf(484,plain,
( ( sdtlpdtrp0 @ xF @ xx )
!= ( sdtlpdtrp0 @ xF @ xx ) ),
inference(pattern_uni,[status(thm)],[483:[bind(A,$thf( xx ))]]) ).
thf(486,plain,
$false,
inference(simp,[status(thm)],[484]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM561+2 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n022.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu May 18 17:21:33 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.98/0.88 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.45/1.04 % [INFO] Parsing done (166ms).
% 1.45/1.05 % [INFO] Running in sequential loop mode.
% 1.94/1.25 % [INFO] eprover registered as external prover.
% 1.94/1.25 % [INFO] cvc4 registered as external prover.
% 1.94/1.25 % [INFO] Scanning for conjecture ...
% 1.94/1.29 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.94/1.29 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.94/1.30 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.94/1.31 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.14/1.32 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.14/1.32 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.14/1.33 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.14/1.33 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.14/1.34 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.14/1.34 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.14/1.35 % [INFO] Found a conjecture and 70 axioms. Running axiom selection ...
% 2.33/1.41 % [INFO] Axiom selection finished. Selected 70 axioms (removed 0 axioms).
% 2.33/1.43 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.33/1.44 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.33/1.44 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.33/1.44 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.33/1.44 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.33/1.45 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.33/1.45 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.33/1.45 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.33/1.46 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.62/1.46 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.62/1.46 % [INFO] Problem is first-order (TPTP FOF).
% 2.62/1.47 % [INFO] Type checking passed.
% 2.62/1.47 % [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.64/2.45 % [INFO] Killing All external provers ...
% 5.64/2.46 % Time passed: 1941ms (effective reasoning time: 1398ms)
% 5.64/2.46 % 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.64/2.46 % Axioms used in derivation (1): m__2911_02
% 5.64/2.46 % No. of inferences in proof: 10
% 5.64/2.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1941 ms resp. 1398 ms w/o parsing
% 5.98/2.47 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.98/2.47 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------