TSTP Solution File: SWW344+1 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SWW344+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n013.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 Jun 24 18:24:58 EDT 2024
% Result : Theorem 8.52s 3.46s
% Output : Refutation 8.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 53 ( 4 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 156 ( 14 ~; 12 |; 0 &; 122 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 8 con; 0-4 aty)
% Number of variables : 28 ( 0 ^ 28 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(v_R_type,type,
v_R: $i > $i > $o ).
thf(v_Z_type,type,
v_Z: $i ).
thf(v_s_H_type,type,
v_s_H: $i ).
thf(c_Natural_Oevaln_type,type,
c_Natural_Oevaln: $i > $i > $i > $i > $o ).
thf(v_c_type,type,
v_c: $i ).
thf(v_s_type,type,
v_s: $i ).
thf(v_n_type,type,
v_n: $i ).
thf(v_s1_type,type,
v_s1: $i ).
thf(v_P_type,type,
v_P: $i > $i > $o ).
thf(v_Q_type,type,
v_Q: $i > $i > $o ).
thf(v_d_type,type,
v_d: $i ).
thf(7,axiom,
v_P @ v_Z @ v_s,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_3) ).
thf(15,plain,
v_P @ v_Z @ v_s,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(3,axiom,
c_Natural_Oevaln @ v_c @ v_s @ v_n @ v_s1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_4) ).
thf(9,plain,
c_Natural_Oevaln @ v_c @ v_s @ v_n @ v_s1,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( v_P @ A @ B )
=> ! [C: $i] :
( ( c_Natural_Oevaln @ v_c @ B @ v_n @ C )
=> ( v_Q @ A @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
thf(10,plain,
! [A: $i,B: $i] :
( ( v_P @ A @ B )
=> ! [C: $i] :
( ( c_Natural_Oevaln @ v_c @ B @ v_n @ C )
=> ( v_Q @ A @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(11,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( v_P @ A @ B )
| ~ ( c_Natural_Oevaln @ v_c @ B @ v_n @ C )
| ( v_Q @ A @ C ) ),
inference(cnf,[status(esa)],[10]) ).
thf(17,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( v_P @ A @ B )
| ( v_Q @ A @ C )
| ( ( c_Natural_Oevaln @ v_c @ v_s @ v_n @ v_s1 )
!= ( c_Natural_Oevaln @ v_c @ B @ v_n @ C ) ) ),
inference(paramod_ordered,[status(thm)],[9,11]) ).
thf(18,plain,
! [A: $i] :
( ~ ( v_P @ A @ v_s )
| ( v_Q @ A @ v_s1 ) ),
inference(pattern_uni,[status(thm)],[17:[bind(A,$thf( A )),bind(B,$thf( v_s )),bind(C,$thf( v_s1 ))]]) ).
thf(27,plain,
! [A: $i] :
( ( v_Q @ A @ v_s1 )
| ( ( v_P @ v_Z @ v_s )
!= ( v_P @ A @ v_s ) ) ),
inference(paramod_ordered,[status(thm)],[15,18]) ).
thf(28,plain,
v_Q @ v_Z @ v_s1,
inference(pattern_uni,[status(thm)],[27:[bind(A,$thf( v_Z ))]]) ).
thf(6,axiom,
c_Natural_Oevaln @ v_d @ v_s1 @ v_n @ v_s_H,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_5) ).
thf(14,plain,
c_Natural_Oevaln @ v_d @ v_s1 @ v_n @ v_s_H,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(5,axiom,
! [A: $i,B: $i] :
( ( v_Q @ A @ B )
=> ! [C: $i] :
( ( c_Natural_Oevaln @ v_d @ B @ v_n @ C )
=> ( v_R @ A @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_2) ).
thf(12,plain,
! [A: $i,B: $i] :
( ( v_Q @ A @ B )
=> ! [C: $i] :
( ( c_Natural_Oevaln @ v_d @ B @ v_n @ C )
=> ( v_R @ A @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(13,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( v_Q @ A @ B )
| ~ ( c_Natural_Oevaln @ v_d @ B @ v_n @ C )
| ( v_R @ A @ C ) ),
inference(cnf,[status(esa)],[12]) ).
thf(29,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( v_Q @ A @ B )
| ( v_R @ A @ C )
| ( ( c_Natural_Oevaln @ v_d @ v_s1 @ v_n @ v_s_H )
!= ( c_Natural_Oevaln @ v_d @ B @ v_n @ C ) ) ),
inference(paramod_ordered,[status(thm)],[14,13]) ).
thf(30,plain,
! [A: $i] :
( ~ ( v_Q @ A @ v_s1 )
| ( v_R @ A @ v_s_H ) ),
inference(pattern_uni,[status(thm)],[29:[bind(A,$thf( A )),bind(B,$thf( v_s1 )),bind(C,$thf( v_s_H ))]]) ).
thf(50,plain,
! [A: $i] :
( ( v_R @ A @ v_s_H )
| ( ( v_Q @ v_Z @ v_s1 )
!= ( v_Q @ A @ v_s1 ) ) ),
inference(paramod_ordered,[status(thm)],[28,30]) ).
thf(51,plain,
v_R @ v_Z @ v_s_H,
inference(pattern_uni,[status(thm)],[50:[bind(A,$thf( v_Z ))]]) ).
thf(1,conjecture,
v_R @ v_Z @ v_s_H,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_6) ).
thf(2,negated_conjecture,
~ ( v_R @ v_Z @ v_s_H ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(8,plain,
~ ( v_R @ v_Z @ v_s_H ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(62,plain,
$false,
inference(rewrite,[status(thm)],[51,8]) ).
thf(63,plain,
$false,
inference(simp,[status(thm)],[62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWW344+1 : TPTP v8.2.0. Released v5.2.0.
% 0.00/0.09 % Command : run_Leo-III %s %d SAT
% 0.08/0.28 % Computer : n013.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Wed Jun 19 04:25:55 EDT 2024
% 0.08/0.29 % CPUTime :
% 0.93/0.89 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 3.19/1.69 % [INFO] Parsing done (795ms).
% 3.19/1.71 % [INFO] Running in sequential loop mode.
% 3.55/2.04 % [INFO] nitpick registered as external prover.
% 3.55/2.05 % [INFO] Scanning for conjecture ...
% 5.70/2.62 % [INFO] Found a conjecture (or negated_conjecture) and 5210 axioms. Running axiom selection ...
% 6.18/2.75 % [INFO] Axiom selection finished. Selected 5 axioms (removed 5205 axioms).
% 6.18/2.77 % [INFO] Problem is first-order (TPTP FOF).
% 6.18/2.78 % [INFO] Type checking passed.
% 6.18/2.78 % [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.52/3.46 % [INFO] Killing All external provers ...
% 8.52/3.46 % Time passed: 3009ms (effective reasoning time: 1747ms)
% 8.52/3.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)>
% 8.52/3.46 % Axioms used in derivation (5): conj_3, conj_2, conj_1, conj_4, conj_5
% 8.52/3.46 % No. of inferences in proof: 25
% 8.52/3.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 3009 ms resp. 1747 ms w/o parsing
% 8.52/3.50 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.52/3.50 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------