TSTP Solution File: SYN062-1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : SYN062-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n002.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 7 11:00:56 EDT 2024
% Result : Unsatisfiable 2.33s 1.37s
% Output : Refutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 32 ( 10 unt; 6 typ; 0 def)
% Number of atoms : 56 ( 3 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 100 ( 27 ~; 24 |; 0 &; 49 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 ^ 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(big_f_type,type,
big_f: $i > $o ).
thf(a_type,type,
a: $i ).
thf(big_k_type,type,
big_k: $i > $o ).
thf(big_j_type,type,
big_j: $i > $o ).
thf(big_i_type,type,
big_i: $i > $o ).
thf(big_h_type,type,
big_h: $i > $o ).
thf(2,negated_conjecture,
big_k @ a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
thf(9,plain,
big_k @ a,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,axiom,
! [A: $i] :
( ~ ( big_k @ A )
| ( big_h @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
thf(18,plain,
! [A: $i] :
( ~ ( big_k @ A )
| ( big_h @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(19,plain,
! [A: $i] :
( ~ ( big_k @ A )
| ( big_h @ A ) ),
inference(cnf,[status(esa)],[18]) ).
thf(20,plain,
! [A: $i] :
( ( big_h @ A )
| ( ( big_k @ a )
!= ( big_k @ A ) ) ),
inference(paramod_ordered,[status(thm)],[9,19]) ).
thf(21,plain,
big_h @ a,
inference(pattern_uni,[status(thm)],[20:[bind(A,$thf( a ))]]) ).
thf(6,axiom,
! [A: $i] :
( ~ ( big_i @ A )
| ~ ( big_h @ A )
| ( big_j @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
thf(16,plain,
! [A: $i] :
( ~ ( big_i @ A )
| ~ ( big_h @ A )
| ( big_j @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(17,plain,
! [A: $i] :
( ~ ( big_i @ A )
| ~ ( big_h @ A )
| ( big_j @ A ) ),
inference(cnf,[status(esa)],[16]) ).
thf(32,plain,
! [A: $i] :
( ~ ( big_i @ A )
| ( big_j @ A )
| ( ( big_h @ a )
!= ( big_h @ A ) ) ),
inference(paramod_ordered,[status(thm)],[21,17]) ).
thf(33,plain,
( ~ ( big_i @ a )
| ( big_j @ a ) ),
inference(pattern_uni,[status(thm)],[32:[bind(A,$thf( a ))]]) ).
thf(3,negated_conjecture,
~ ( big_j @ a ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
thf(10,plain,
~ ( big_j @ a ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(11,plain,
~ ( big_j @ a ),
inference(polarity_switch,[status(thm)],[10]) ).
thf(1,negated_conjecture,
big_f @ a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
thf(8,plain,
big_f @ a,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(5,axiom,
! [A: $i] :
( ~ ( big_f @ A )
| ~ ( big_h @ A )
| ( big_i @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
thf(14,plain,
! [A: $i] :
( ~ ( big_f @ A )
| ~ ( big_h @ A )
| ( big_i @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(15,plain,
! [A: $i] :
( ~ ( big_f @ A )
| ~ ( big_h @ A )
| ( big_i @ A ) ),
inference(cnf,[status(esa)],[14]) ).
thf(24,plain,
! [A: $i] :
( ~ ( big_h @ A )
| ( big_i @ A )
| ( ( big_f @ a )
!= ( big_f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[8,15]) ).
thf(25,plain,
( ~ ( big_h @ a )
| ( big_i @ a ) ),
inference(pattern_uni,[status(thm)],[24:[bind(A,$thf( a ))]]) ).
thf(30,plain,
( ~ $true
| ( big_i @ a ) ),
inference(rewrite,[status(thm)],[25,21]) ).
thf(31,plain,
big_i @ a,
inference(simp,[status(thm)],[30]) ).
thf(42,plain,
( ~ $true
| $false ),
inference(rewrite,[status(thm)],[33,11,31]) ).
thf(43,plain,
$false,
inference(simp,[status(thm)],[42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SYN062-1 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.11 % Command : run_Leo-III %s %d
% 0.11/0.29 % Computer : n002.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Mon May 6 21:10:08 EDT 2024
% 0.11/0.29 % CPUTime :
% 0.70/0.67 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.98/0.77 % [INFO] Parsing done (96ms).
% 0.98/0.77 % [INFO] Running in sequential loop mode.
% 1.33/0.96 % [INFO] nitpick registered as external prover.
% 1.33/0.97 % [INFO] Scanning for conjecture ...
% 1.43/1.01 % [INFO] Found a conjecture and 4 axioms. Running axiom selection ...
% 1.43/1.03 % [INFO] Axiom selection finished. Selected 4 axioms (removed 0 axioms).
% 1.43/1.03 % [INFO] Problem is propositional (TPTP CNF).
% 1.43/1.03 % [INFO] Type checking passed.
% 1.59/1.04 % [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 ...
% 2.33/1.37 % [INFO] Killing All external provers ...
% 2.33/1.37 % Time passed: 962ms (effective reasoning time: 595ms)
% 2.33/1.37 % 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)>
% 2.33/1.37 % Axioms used in derivation (3): clause_4, clause_3, clause_2
% 2.33/1.37 % No. of inferences in proof: 26
% 2.33/1.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 962 ms resp. 595 ms w/o parsing
% 2.33/1.40 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.33/1.40 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------