TSTP Solution File: GEO252+3 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : GEO252+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n025.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:31:50 EDT 2024
% Result : Theorem 4.17s 2.11s
% Output : Refutation 4.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 18 ( 4 unt; 8 typ; 0 def)
% Number of atoms : 22 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 67 ( 6 ~; 3 |; 6 &; 49 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 0 ^ 15 !; 4 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(left_apart_point_type,type,
left_apart_point: $i > $i > $o ).
thf(right_apart_point_type,type,
right_apart_point: $i > $i > $o ).
thf(distinct_points_type,type,
distinct_points: $i > $i > $o ).
thf(left_convergent_lines_type,type,
left_convergent_lines: $i > $i > $o ).
thf(line_connecting_type,type,
line_connecting: $i > $i > $i ).
thf(reverse_line_type,type,
reverse_line: $i > $i ).
thf(sk1_type,type,
sk1: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( ( left_apart_point @ A @ C )
& ( right_apart_point @ B @ C ) )
=> ( ( distinct_points @ A @ B )
& ( left_convergent_lines @ ( line_connecting @ A @ B ) @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( ( left_apart_point @ A @ C )
& ( right_apart_point @ B @ C ) )
=> ( ( distinct_points @ A @ B )
& ( left_convergent_lines @ ( line_connecting @ A @ B ) @ C ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(39,plain,
~ ! [A: $i,B: $i,C: $i] :
( ( ( left_apart_point @ A @ C )
& ( right_apart_point @ B @ C ) )
=> ( ( distinct_points @ A @ B )
& ( left_convergent_lines @ ( line_connecting @ A @ B ) @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(42,plain,
left_apart_point @ sk1 @ sk3,
inference(cnf,[status(esa)],[39]) ).
thf(31,axiom,
! [A: $i,B: $i] :
~ ( ( left_apart_point @ A @ B )
| ( left_apart_point @ A @ ( reverse_line @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax10_basics) ).
thf(156,plain,
! [A: $i,B: $i] :
~ ( ( left_apart_point @ A @ B )
| ( left_apart_point @ A @ ( reverse_line @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[31]) ).
thf(157,plain,
~ ( ? [A: $i,B: $i] : ( left_apart_point @ A @ B )
| ? [A: $i,B: $i] : ( left_apart_point @ A @ ( reverse_line @ B ) ) ),
inference(miniscope,[status(thm)],[156]) ).
thf(159,plain,
! [B: $i,A: $i] :
~ ( left_apart_point @ A @ B ),
inference(cnf,[status(esa)],[157]) ).
thf(181,plain,
$false,
inference(rewrite,[status(thm)],[42,159]) ).
thf(182,plain,
$false,
inference(simp,[status(thm)],[181]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO252+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.16 % Command : run_Leo-III %s %d
% 0.17/0.37 % Computer : n025.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 300
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Tue May 7 01:36:54 EDT 2024
% 0.17/0.37 % CPUTime :
% 0.89/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.39/1.00 % [INFO] Parsing done (143ms).
% 1.39/1.01 % [INFO] Running in sequential loop mode.
% 1.85/1.24 % [INFO] nitpick registered as external prover.
% 1.85/1.24 % [INFO] Scanning for conjecture ...
% 2.06/1.31 % [INFO] Found a conjecture and 36 axioms. Running axiom selection ...
% 2.06/1.36 % [INFO] Axiom selection finished. Selected 36 axioms (removed 0 axioms).
% 2.33/1.41 % [INFO] Problem is first-order (TPTP FOF).
% 2.47/1.42 % [INFO] Type checking passed.
% 2.47/1.42 % [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.17/2.10 % [INFO] Killing All external provers ...
% 4.17/2.10 % Time passed: 1570ms (effective reasoning time: 1085ms)
% 4.17/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.17/2.10 % Axioms used in derivation (1): ax10_basics
% 4.17/2.10 % No. of inferences in proof: 10
% 4.17/2.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1570 ms resp. 1085 ms w/o parsing
% 4.34/2.12 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.34/2.12 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------