TSTP Solution File: CSR136^2 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : CSR136^2 : TPTP v8.2.0. Released v4.1.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 : Mon May 20 19:31:41 EDT 2024
% Result : Theorem 8.66s 2.58s
% Output : Refutation 8.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 23 ( 11 unt; 5 typ; 0 def)
% Number of atoms : 20 ( 6 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 117 ( 21 ~; 12 |; 6 &; 78 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 ^ 24 !; 3 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
thf(num_type,type,
num: $tType ).
thf(lBill_THFTYPE_i_type,type,
lBill_THFTYPE_i: $i ).
thf(lMary_THFTYPE_i_type,type,
lMary_THFTYPE_i: $i ).
thf(lSue_THFTYPE_i_type,type,
lSue_THFTYPE_i: $i ).
thf(likes_THFTYPE_IiioI_type,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(5,axiom,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_002) ).
thf(18,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(19,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(polarity_switch,[status(thm)],[18]) ).
thf(3,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax) ).
thf(16,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(1,conjecture,
? [A: $i > $i > $o] :
( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [B: $i,C: $i] : ( A @ B @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(2,negated_conjecture,
~ ? [A: $i > $i > $o] :
( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [B: $i,C: $i] : ( A @ B @ C ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(14,plain,
~ ? [A: $i > $i > $o] :
( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [B: $i,C: $i] : ( A @ B @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(15,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( A @ B @ C ) ),
inference(cnf,[status(esa)],[14]) ).
thf(39,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( A @ B @ C )
| ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[15]) ).
thf(58,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( A @ B @ C )
| ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(pre_uni,[status(thm)],[39:[]]) ).
thf(59,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ( A @ B @ C )
| ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(pre_uni,[status(thm)],[58:[]]) ).
thf(1156,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ( A @ B @ C )
| ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(paramod_ordered,[status(thm)],[16,59]) ).
thf(1197,plain,
! [A: $i] :
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ A )
| ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(pre_uni,[status(thm)],[1156:[bind(A,$thf( ^ [D: $i] : ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i ) )),bind(B,$thf( B )),bind(C,$thf( C ))]]) ).
thf(1199,plain,
! [A: $i] : ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ A ),
inference(pattern_uni,[status(thm)],[1197:[]]) ).
thf(1275,plain,
! [A: $i] : ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ A ),
inference(simp,[status(thm)],[1199]) ).
thf(1337,plain,
~ $true,
inference(rewrite,[status(thm)],[19,1275]) ).
thf(1338,plain,
$false,
inference(simp,[status(thm)],[1337]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR136^2 : TPTP v8.2.0. Released v4.1.0.
% 0.11/0.15 % Command : run_Leo-III %s %d
% 0.15/0.37 % Computer : n025.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 01:46:09 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.87/0.85 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.19/0.95 % [INFO] Parsing done (99ms).
% 1.19/0.96 % [INFO] Running in sequential loop mode.
% 1.53/1.16 % [INFO] nitpick registered as external prover.
% 1.53/1.16 % [INFO] Scanning for conjecture ...
% 1.73/1.22 % [INFO] Found a conjecture (or negated_conjecture) and 11 axioms. Running axiom selection ...
% 1.82/1.24 % [INFO] Axiom selection finished. Selected 11 axioms (removed 0 axioms).
% 1.87/1.24 % [INFO] Problem is higher-order (TPTP THF).
% 1.87/1.24 % [INFO] Type checking passed.
% 1.87/1.24 % [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 ...
% 8.66/2.58 % [INFO] Killing All external provers ...
% 8.66/2.58 % Time passed: 2053ms (effective reasoning time: 1615ms)
% 8.66/2.58 % 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)>
% 8.66/2.58 % Axioms used in derivation (2): ax_002, ax
% 8.66/2.58 % No. of inferences in proof: 18
% 8.66/2.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2053 ms resp. 1615 ms w/o parsing
% 8.66/2.61 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.66/2.61 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------