TSTP Solution File: SYN072-1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : SYN072-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n006.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:01:01 EDT 2024
% Result : Unsatisfiable 3.81s 1.88s
% Output : Refutation 3.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 42 ( 18 unt; 6 typ; 0 def)
% Number of atoms : 64 ( 52 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 67 ( 32 ~; 24 |; 0 &; 11 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 10 ( 0 ^ 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(big_p_type,type,
big_p: $i > $o ).
thf(e_type,type,
e: $i ).
thf(c_type,type,
c: $i ).
thf(d_type,type,
d: $i ).
thf(a_type,type,
a: $i ).
thf(b_type,type,
b: $i ).
thf(2,axiom,
! [A: $i] :
( ( A = c )
| ( A = d ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
thf(8,plain,
! [A: $i] :
( ( A = c )
| ( A = d ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(9,plain,
! [A: $i] :
( ( A = c )
| ( A = d ) ),
inference(cnf,[status(esa)],[8]) ).
thf(10,plain,
! [A: $i] :
( ( A = c )
| ( A = d ) ),
inference(lifteq,[status(thm)],[9]) ).
thf(5,axiom,
a != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
thf(13,plain,
a != b,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(14,plain,
a != b,
inference(polarity_switch,[status(thm)],[13]) ).
thf(15,plain,
b != a,
inference(lifteq,[status(thm)],[14]) ).
thf(29,plain,
! [A: $i] :
( ( A = c )
| ( a != d )
| ( A != b ) ),
inference(paramod_ordered,[status(thm)],[10,15]) ).
thf(30,plain,
( ( b = c )
| ( a != d ) ),
inference(pattern_uni,[status(thm)],[29:[bind(A,$thf( b ))]]) ).
thf(92,plain,
! [A: $i] :
( ( A = c )
| ( b = c )
| ( A != a ) ),
inference(paramod_ordered,[status(thm)],[10,30]) ).
thf(93,plain,
( ( a = c )
| ( b = c ) ),
inference(pattern_uni,[status(thm)],[92:[bind(A,$thf( a ))]]) ).
thf(3,axiom,
big_p @ a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
thf(11,plain,
big_p @ a,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(1,negated_conjecture,
~ ( big_p @ e ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(6,plain,
~ ( big_p @ e ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(7,plain,
~ ( big_p @ e ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(16,plain,
( ( big_p @ a )
!= ( big_p @ e ) ),
inference(paramod_ordered,[status(thm)],[11,7]) ).
thf(17,plain,
a != e,
inference(simp,[status(thm)],[16]) ).
thf(20,plain,
! [A: $i] :
( ( A = c )
| ( d != e )
| ( A != a ) ),
inference(paramod_ordered,[status(thm)],[10,17]) ).
thf(21,plain,
( ( a = c )
| ( d != e ) ),
inference(pattern_uni,[status(thm)],[20:[bind(A,$thf( a ))]]) ).
thf(4,axiom,
big_p @ b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
thf(12,plain,
big_p @ b,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(18,plain,
( ( big_p @ b )
!= ( big_p @ e ) ),
inference(paramod_ordered,[status(thm)],[12,7]) ).
thf(19,plain,
b != e,
inference(simp,[status(thm)],[18]) ).
thf(27,plain,
! [A: $i] :
( ( A = c )
| ( d != e )
| ( A != b ) ),
inference(paramod_ordered,[status(thm)],[10,19]) ).
thf(28,plain,
( ( b = c )
| ( d != e ) ),
inference(pattern_uni,[status(thm)],[27:[bind(A,$thf( b ))]]) ).
thf(53,plain,
( ( d != e )
| ( a != c )
| ( b != b ) ),
inference(paramod_ordered,[status(thm)],[28,15]) ).
thf(54,plain,
( ( d != e )
| ( a != c ) ),
inference(pattern_uni,[status(thm)],[53:[]]) ).
thf(132,plain,
( ( d != e )
| ( a != a ) ),
inference(paramod_ordered,[status(thm)],[21,54]) ).
thf(133,plain,
d != e,
inference(pattern_uni,[status(thm)],[132:[]]) ).
thf(157,plain,
! [A: $i] :
( ( A = c )
| ( A != e )
| ( d != d ) ),
inference(paramod_ordered,[status(thm)],[10,133]) ).
thf(158,plain,
! [A: $i] :
( ( A = c )
| ( A != e ) ),
inference(pattern_uni,[status(thm)],[157:[]]) ).
thf(159,plain,
c = e,
inference(simp,[status(thm)],[158]) ).
thf(191,plain,
( ( a = e )
| ( b = e ) ),
inference(rewrite,[status(thm)],[93,159]) ).
thf(192,plain,
$false,
inference(simplifyReflect,[status(thm)],[191,17,19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN072-1 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.15 % Command : run_Leo-III %s %d
% 0.16/0.35 % Computer : n006.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon May 6 21:10:24 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.85/0.83 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.20/0.93 % [INFO] Parsing done (98ms).
% 1.20/0.94 % [INFO] Running in sequential loop mode.
% 1.45/1.14 % [INFO] nitpick registered as external prover.
% 1.45/1.14 % [INFO] Scanning for conjecture ...
% 1.71/1.18 % [INFO] Found a conjecture and 4 axioms. Running axiom selection ...
% 1.71/1.20 % [INFO] Axiom selection finished. Selected 4 axioms (removed 0 axioms).
% 1.71/1.20 % [INFO] Problem is propositional (TPTP CNF).
% 1.71/1.21 % [INFO] Type checking passed.
% 1.71/1.21 % [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 ...
% 1.91/1.31 % [INFO] [Domain constraints] Detected constraint on $i
% 1.91/1.31 % [INFO] [Domain constraints] dom($i) ⊆ {c,d}
% 3.81/1.87 % [INFO] Killing All external provers ...
% 3.81/1.88 % Time passed: 1364ms (effective reasoning time: 932ms)
% 3.81/1.88 % 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.81/1.88 % Axioms used in derivation (4): clause_1, clause_4, clause_2, clause_3
% 3.81/1.88 % No. of inferences in proof: 36
% 3.81/1.88 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1364 ms resp. 932 ms w/o parsing
% 3.81/1.90 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.81/1.90 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------