TSTP Solution File: CSR032+1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : CSR032+1 : TPTP v8.1.2. Released v3.4.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:28:31 EDT 2024
% Result : Theorem 7.61s 2.52s
% Output : Refutation 7.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 28 ( 7 unt; 9 typ; 0 def)
% Number of atoms : 35 ( 2 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 86 ( 11 ~; 4 |; 0 &; 63 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 14 ( 0 ^ 10 !; 4 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(mtvisible_type,type,
mtvisible: $i > $o ).
thf(c_reasoningaboutpossibleantecedentsmt_type,type,
c_reasoningaboutpossibleantecedentsmt: $i ).
thf(isa_type,type,
isa: $i > $i > $o ).
thf(f_citynamedfn_type,type,
f_citynamedfn: $i > $i > $i ).
thf(s_agen_type,type,
s_agen: $i ).
thf(c_france_type,type,
c_france: $i ).
thf(c_trajector_underspecified_type,type,
c_trajector_underspecified: $i ).
thf(trajector_underspecified_type,type,
trajector_underspecified: $i > $o ).
thf(individual_type,type,
individual: $i > $o ).
thf(44,axiom,
! [A: $i] :
( ( trajector_underspecified @ A )
=> ( isa @ A @ c_trajector_underspecified ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just46) ).
thf(143,plain,
! [A: $i] :
( ( trajector_underspecified @ A )
=> ( isa @ A @ c_trajector_underspecified ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[44]) ).
thf(144,plain,
! [A: $i] :
( ~ ( trajector_underspecified @ A )
| ( isa @ A @ c_trajector_underspecified ) ),
inference(cnf,[status(esa)],[143]) ).
thf(1,conjecture,
? [A: $i] :
( ( mtvisible @ c_reasoningaboutpossibleantecedentsmt )
=> ( isa @ ( f_citynamedfn @ s_agen @ c_france ) @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query32) ).
thf(2,negated_conjecture,
~ ? [A: $i] :
( ( mtvisible @ c_reasoningaboutpossibleantecedentsmt )
=> ( isa @ ( f_citynamedfn @ s_agen @ c_france ) @ A ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(58,plain,
~ ? [A: $i] :
( ( mtvisible @ c_reasoningaboutpossibleantecedentsmt )
=> ( isa @ ( f_citynamedfn @ s_agen @ c_france ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(59,plain,
~ ( ( mtvisible @ c_reasoningaboutpossibleantecedentsmt )
=> ? [A: $i] : ( isa @ ( f_citynamedfn @ s_agen @ c_france ) @ A ) ),
inference(miniscope,[status(thm)],[58]) ).
thf(60,plain,
! [A: $i] :
~ ( isa @ ( f_citynamedfn @ s_agen @ c_france ) @ A ),
inference(cnf,[status(esa)],[59]) ).
thf(773,plain,
! [B: $i,A: $i] :
( ~ ( trajector_underspecified @ A )
| ( ( isa @ A @ c_trajector_underspecified )
!= ( isa @ ( f_citynamedfn @ s_agen @ c_france ) @ B ) ) ),
inference(paramod_ordered,[status(thm)],[144,60]) ).
thf(774,plain,
~ ( trajector_underspecified @ ( f_citynamedfn @ s_agen @ c_france ) ),
inference(pattern_uni,[status(thm)],[773:[bind(A,$thf( f_citynamedfn @ s_agen @ c_france )),bind(B,$thf( c_trajector_underspecified ))]]) ).
thf(51,axiom,
individual @ ( f_citynamedfn @ s_agen @ c_france ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just1) ).
thf(156,plain,
individual @ ( f_citynamedfn @ s_agen @ c_france ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[51]) ).
thf(18,axiom,
! [A: $i] :
( ( individual @ A )
=> ( trajector_underspecified @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just10) ).
thf(91,plain,
! [A: $i] :
( ( individual @ A )
=> ( trajector_underspecified @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).
thf(92,plain,
! [A: $i] :
( ~ ( individual @ A )
| ( trajector_underspecified @ A ) ),
inference(cnf,[status(esa)],[91]) ).
thf(472,plain,
! [A: $i] :
( ( trajector_underspecified @ A )
| ( ( individual @ ( f_citynamedfn @ s_agen @ c_france ) )
!= ( individual @ A ) ) ),
inference(paramod_ordered,[status(thm)],[156,92]) ).
thf(473,plain,
trajector_underspecified @ ( f_citynamedfn @ s_agen @ c_france ),
inference(pattern_uni,[status(thm)],[472:[bind(A,$thf( f_citynamedfn @ s_agen @ c_france ))]]) ).
thf(835,plain,
~ $true,
inference(rewrite,[status(thm)],[774,473]) ).
thf(836,plain,
$false,
inference(simp,[status(thm)],[835]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : CSR032+1 : TPTP v8.1.2. Released v3.4.0.
% 0.10/0.13 % Command : run_Leo-III %s %d
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 6 23:23:54 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.87/0.89 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.12/1.01 % [INFO] Parsing done (113ms).
% 1.12/1.01 % [INFO] Running in sequential loop mode.
% 1.44/1.20 % [INFO] nitpick registered as external prover.
% 1.44/1.21 % [INFO] Scanning for conjecture ...
% 1.61/1.26 % [INFO] Found a conjecture and 67 axioms. Running axiom selection ...
% 1.78/1.31 % [INFO] Axiom selection finished. Selected 55 axioms (removed 12 axioms).
% 1.78/1.35 % [INFO] Problem is first-order (TPTP FOF).
% 1.78/1.35 % [INFO] Type checking passed.
% 1.78/1.36 % [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 ...
% 7.61/2.52 % [INFO] Killing All external provers ...
% 7.61/2.52 % Time passed: 2025ms (effective reasoning time: 1502ms)
% 7.61/2.52 % 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)>
% 7.61/2.52 % Axioms used in derivation (3): just46, just1, just10
% 7.61/2.52 % No. of inferences in proof: 19
% 7.61/2.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2025 ms resp. 1502 ms w/o parsing
% 7.61/2.55 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.61/2.55 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------