TSTP Solution File: COM012+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : COM012+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n024.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 10:13:53 EDT 2023
% Result : Theorem 3.41s 1.88s
% Output : Refutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 20
% Syntax : Number of formulae : 32 ( 5 unt; 10 typ; 0 def)
% Number of atoms : 93 ( 3 equ; 0 cnn)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 227 ( 2 ~; 6 |; 38 &; 154 @)
% ( 2 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 36 ( 0 ^; 33 !; 3 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(aElement0_type,type,
aElement0: $i > $o ).
thf(aRewritingSystem0_type,type,
aRewritingSystem0: $i > $o ).
thf(sdtmndtplgtdt0_type,type,
sdtmndtplgtdt0: $i > $i > $i > $o ).
thf(aReductOfIn0_type,type,
aReductOfIn0: $i > $i > $i > $o ).
thf(sdtmndtasgtdt0_type,type,
sdtmndtasgtdt0: $i > $i > $i > $o ).
thf(xx_type,type,
xx: $i ).
thf(xR_type,type,
xR: $i ).
thf(xy_type,type,
xy: $i ).
thf(xz_type,type,
xz: $i ).
thf(iLess0_type,type,
iLess0: $i > $i > $o ).
thf(11,axiom,
( ( aElement0 @ xx )
& ( aRewritingSystem0 @ xR )
& ( aElement0 @ xy )
& ( aElement0 @ xz ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__349) ).
thf(37,plain,
( ( aElement0 @ xx )
& ( aRewritingSystem0 @ xR )
& ( aElement0 @ xy )
& ( aElement0 @ xz ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(5,axiom,
! [A: $i] :
( ( aElement0 @ A )
=> $true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mElmSort) ).
thf(29,plain,
$true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(8,axiom,
! [A: $i,B: $i] :
( ( ( aElement0 @ A )
& ( aElement0 @ B ) )
=> ( ( iLess0 @ A @ B )
=> $true ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mWFOrd) ).
thf(33,plain,
$true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(9,axiom,
! [A: $i,B: $i,C: $i] :
( ( ( aElement0 @ A )
& ( aRewritingSystem0 @ B )
& ( aElement0 @ C ) )
=> ( ( sdtmndtplgtdt0 @ A @ B @ C )
=> $true ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCbr) ).
thf(34,plain,
$true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(1,conjecture,
( ( ( sdtmndtasgtdt0 @ xx @ xR @ xy )
& ( sdtmndtasgtdt0 @ xy @ xR @ xz ) )
=> ( sdtmndtasgtdt0 @ xx @ xR @ xz ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
thf(2,negated_conjecture,
~ ( ( ( sdtmndtasgtdt0 @ xx @ xR @ xy )
& ( sdtmndtasgtdt0 @ xy @ xR @ xz ) )
=> ( sdtmndtasgtdt0 @ xx @ xR @ xz ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(12,plain,
~ ( ( ( sdtmndtasgtdt0 @ xx @ xR @ xy )
& ( sdtmndtasgtdt0 @ xy @ xR @ xz ) )
=> ( sdtmndtasgtdt0 @ xx @ xR @ xz ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(10,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( aElement0 @ A )
& ( aRewritingSystem0 @ B )
& ( aElement0 @ C )
& ( aElement0 @ D ) )
=> ( ( ( sdtmndtplgtdt0 @ A @ B @ C )
& ( sdtmndtplgtdt0 @ C @ B @ D ) )
=> ( sdtmndtplgtdt0 @ A @ B @ D ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCTrans) ).
thf(35,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( aElement0 @ A )
& ( aRewritingSystem0 @ B )
& ( aElement0 @ C )
& ( aElement0 @ D ) )
=> ( ( ( sdtmndtplgtdt0 @ A @ B @ C )
& ( sdtmndtplgtdt0 @ C @ B @ D ) )
=> ( sdtmndtplgtdt0 @ A @ B @ D ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(4,axiom,
! [A: $i,B: $i,C: $i] :
( ( ( aElement0 @ A )
& ( aRewritingSystem0 @ B )
& ( aElement0 @ C ) )
=> ( ( sdtmndtplgtdt0 @ A @ B @ C )
<=> ( ( aReductOfIn0 @ C @ A @ B )
| ? [D: $i] :
( ( aElement0 @ D )
& ( aReductOfIn0 @ D @ A @ B )
& ( sdtmndtplgtdt0 @ D @ B @ C ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCDef) ).
thf(23,plain,
! [A: $i,B: $i,C: $i] :
( ( ( aElement0 @ A )
& ( aRewritingSystem0 @ B )
& ( aElement0 @ C ) )
=> ( ( ( sdtmndtplgtdt0 @ A @ B @ C )
=> ( ( aReductOfIn0 @ C @ A @ B )
| ? [D: $i] :
( ( aElement0 @ D )
& ( aReductOfIn0 @ D @ A @ B )
& ( sdtmndtplgtdt0 @ D @ B @ C ) ) ) )
& ( ( ( aReductOfIn0 @ C @ A @ B )
| ? [D: $i] :
( ( aElement0 @ D )
& ( aReductOfIn0 @ D @ A @ B )
& ( sdtmndtplgtdt0 @ D @ B @ C ) ) )
=> ( sdtmndtplgtdt0 @ A @ B @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(6,axiom,
! [A: $i] :
( ( aRewritingSystem0 @ A )
=> $true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mRelSort) ).
thf(30,plain,
$true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(3,axiom,
! [A: $i,B: $i,C: $i] :
( ( ( aElement0 @ A )
& ( aRewritingSystem0 @ B )
& ( aElement0 @ C ) )
=> ( ( sdtmndtasgtdt0 @ A @ B @ C )
<=> ( ( A = C )
| ( sdtmndtplgtdt0 @ A @ B @ C ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCRDef) ).
thf(16,plain,
! [A: $i,B: $i,C: $i] :
( ( ( aElement0 @ A )
& ( aRewritingSystem0 @ B )
& ( aElement0 @ C ) )
=> ( ( ( sdtmndtasgtdt0 @ A @ B @ C )
=> ( ( A = C )
| ( sdtmndtplgtdt0 @ A @ B @ C ) ) )
& ( ( ( A = C )
| ( sdtmndtplgtdt0 @ A @ B @ C ) )
=> ( sdtmndtasgtdt0 @ A @ B @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(7,axiom,
! [A: $i,B: $i] :
( ( ( aElement0 @ A )
& ( aRewritingSystem0 @ B ) )
=> ! [C: $i] :
( ( aReductOfIn0 @ C @ A @ B )
=> ( aElement0 @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mReduct) ).
thf(31,plain,
! [A: $i,B: $i] :
( ( ( aElement0 @ A )
& ( aRewritingSystem0 @ B ) )
=> ! [C: $i] :
( ( aReductOfIn0 @ C @ A @ B )
=> ( aElement0 @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(72,plain,
$false,
inference(cvc4,[status(thm)],[37,29,33,34,12,35,23,30,16,31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COM012+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.15 % Command : run_Leo-III %s %d
% 0.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 19 03:23:22 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.97/0.88 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.27/1.02 % [INFO] Parsing done (132ms).
% 1.27/1.03 % [INFO] Running in sequential loop mode.
% 1.68/1.22 % [INFO] eprover registered as external prover.
% 1.71/1.22 % [INFO] cvc4 registered as external prover.
% 1.71/1.23 % [INFO] Scanning for conjecture ...
% 1.71/1.27 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.71/1.28 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.71/1.30 % [INFO] Found a conjecture and 9 axioms. Running axiom selection ...
% 1.94/1.32 % [INFO] Axiom selection finished. Selected 9 axioms (removed 0 axioms).
% 1.94/1.32 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.94/1.32 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.94/1.34 % [INFO] Problem is first-order (TPTP FOF).
% 1.94/1.34 % [INFO] Type checking passed.
% 1.94/1.34 % [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.41/1.87 % External prover 'cvc4' found a proof!
% 3.41/1.87 % [INFO] Killing All external provers ...
% 3.41/1.87 % Time passed: 1363ms (effective reasoning time: 843ms)
% 3.41/1.87 % 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.41/1.88 % Axioms used in derivation (9): mWFOrd, m__349, mTCTrans, mReduct, mTCbr, mTCDef, mElmSort, mRelSort, mTCRDef
% 3.41/1.88 % No. of inferences in proof: 22
% 3.41/1.88 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1363 ms resp. 843 ms w/o parsing
% 3.64/1.91 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.64/1.91 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------