TSTP Solution File: LCL169-3 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : LCL169-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n020.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 10:40:13 EDT 2024
% Result : Unsatisfiable 4.75s 2.10s
% Output : Refutation 4.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 25 ( 14 unt; 6 typ; 0 def)
% Number of atoms : 26 ( 5 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 107 ( 9 ~; 5 |; 0 &; 93 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 ^ 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(theorem_type,type,
theorem: $i > $o ).
thf(implies_type,type,
implies: $i > $i > $i ).
thf(p_type,type,
p: $i ).
thf(not_type,type,
not: $i > $i ).
thf(axiom_type,type,
axiom: $i > $o ).
thf(or_type,type,
or: $i > $i > $i ).
thf(1,negated_conjecture,
~ ( theorem @ ( implies @ ( implies @ p @ ( not @ p ) ) @ ( not @ p ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
thf(10,plain,
~ ( theorem @ ( implies @ ( implies @ p @ ( not @ p ) ) @ ( not @ p ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(11,plain,
~ ( theorem @ ( implies @ ( implies @ p @ ( not @ p ) ) @ ( not @ p ) ) ),
inference(polarity_switch,[status(thm)],[10]) ).
thf(7,axiom,
! [B: $i,A: $i] :
( ( implies @ A @ B )
= ( or @ ( not @ A ) @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
thf(17,plain,
! [B: $i,A: $i] :
( ( implies @ A @ B )
= ( or @ ( not @ A ) @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(18,plain,
! [B: $i,A: $i] :
( ( or @ ( not @ A ) @ B )
= ( implies @ A @ B ) ),
inference(lifteq,[status(thm)],[17]) ).
thf(2,axiom,
! [A: $i] : ( axiom @ ( implies @ ( or @ A @ A ) @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
thf(12,plain,
! [A: $i] : ( axiom @ ( implies @ ( or @ A @ A ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(8,axiom,
! [A: $i] :
( ( theorem @ A )
| ~ ( axiom @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
thf(19,plain,
! [A: $i] :
( ( theorem @ A )
| ~ ( axiom @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(20,plain,
! [A: $i] :
( ( theorem @ A )
| ~ ( axiom @ A ) ),
inference(cnf,[status(esa)],[19]) ).
thf(36,plain,
! [B: $i,A: $i] :
( ( theorem @ B )
| ( ( axiom @ ( implies @ ( or @ A @ A ) @ A ) )
!= ( axiom @ B ) ) ),
inference(paramod_ordered,[status(thm)],[12,20]) ).
thf(37,plain,
! [A: $i] : ( theorem @ ( implies @ ( or @ A @ A ) @ A ) ),
inference(pattern_uni,[status(thm)],[36:[bind(A,$thf( D )),bind(B,$thf( implies @ ( or @ D @ D ) @ D ))]]) ).
thf(40,plain,
! [A: $i] : ( theorem @ ( implies @ ( or @ A @ A ) @ A ) ),
inference(simp,[status(thm)],[37]) ).
thf(79,plain,
! [C: $i,B: $i,A: $i] :
( ( theorem @ ( implies @ ( implies @ A @ B ) @ C ) )
| ( ( or @ ( not @ A ) @ B )
!= ( or @ C @ C ) ) ),
inference(paramod_ordered,[status(thm)],[18,40]) ).
thf(80,plain,
! [A: $i] : ( theorem @ ( implies @ ( implies @ A @ ( not @ A ) ) @ ( not @ A ) ) ),
inference(pattern_uni,[status(thm)],[79:[bind(A,$thf( E )),bind(B,$thf( not @ E )),bind(C,$thf( not @ E ))]]) ).
thf(85,plain,
! [A: $i] : ( theorem @ ( implies @ ( implies @ A @ ( not @ A ) ) @ ( not @ A ) ) ),
inference(simp,[status(thm)],[80]) ).
thf(95,plain,
~ $true,
inference(rewrite,[status(thm)],[11,85]) ).
thf(96,plain,
$false,
inference(simp,[status(thm)],[95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL169-3 : TPTP v8.1.2. Released v2.3.0.
% 0.08/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n020.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 6 19:15:54 EDT 2024
% 0.16/0.37 % CPUTime :
% 1.00/0.88 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.12/1.00 % [INFO] Parsing done (119ms).
% 1.12/1.01 % [INFO] Running in sequential loop mode.
% 1.78/1.22 % [INFO] nitpick registered as external prover.
% 1.78/1.23 % [INFO] Scanning for conjecture ...
% 1.81/1.28 % [INFO] Found a conjecture and 8 axioms. Running axiom selection ...
% 1.81/1.30 % [INFO] Axiom selection finished. Selected 8 axioms (removed 0 axioms).
% 1.81/1.31 % [INFO] Problem is propositional (TPTP CNF).
% 1.81/1.31 % [INFO] Type checking passed.
% 2.02/1.31 % [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 ...
% 4.75/2.10 % [INFO] Killing All external provers ...
% 4.75/2.10 % Time passed: 1553ms (effective reasoning time: 1090ms)
% 4.75/2.10 % 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)>
% 4.75/2.10 % Axioms used in derivation (3): implies_definition, axiom_1_2, rule_1
% 4.75/2.10 % No. of inferences in proof: 19
% 4.75/2.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1553 ms resp. 1090 ms w/o parsing
% 4.79/2.13 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.79/2.13 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------