TSTP Solution File: GEO117+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GEO117+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n011.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 : Wed Aug 30 22:46:12 EDT 2023
% Result : Theorem 0.21s 0.61s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 45
% Syntax : Number of formulae : 58 ( 7 unt; 41 typ; 0 def)
% Number of atoms : 81 ( 4 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 104 ( 40 ~; 39 |; 21 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 86 ( 39 >; 47 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-4 aty)
% Number of functors : 28 ( 28 usr; 2 con; 0-5 aty)
% Number of variables : 64 ( 6 sgn; 41 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
part_of: ( $i * $i ) > $o ).
tff(decl_23,type,
incident_c: ( $i * $i ) > $o ).
tff(decl_24,type,
sum: ( $i * $i ) > $i ).
tff(decl_25,type,
end_point: ( $i * $i ) > $o ).
tff(decl_26,type,
inner_point: ( $i * $i ) > $o ).
tff(decl_27,type,
meet: ( $i * $i * $i ) > $o ).
tff(decl_28,type,
closed: $i > $o ).
tff(decl_29,type,
open: $i > $o ).
tff(decl_30,type,
between_c: ( $i * $i * $i * $i ) > $o ).
tff(decl_31,type,
between_o: ( $i * $i * $i * $i ) > $o ).
tff(decl_32,type,
ordered_by: ( $i * $i * $i ) > $o ).
tff(decl_33,type,
start_point: ( $i * $i ) > $o ).
tff(decl_34,type,
incident_o: ( $i * $i ) > $o ).
tff(decl_35,type,
finish_point: ( $i * $i ) > $o ).
tff(decl_36,type,
underlying_curve: $i > $i ).
tff(decl_37,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_38,type,
esk2_3: ( $i * $i * $i ) > $i ).
tff(decl_39,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_40,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_41,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_42,type,
esk6_1: $i > $i ).
tff(decl_43,type,
esk7_1: $i > $i ).
tff(decl_44,type,
esk8_1: $i > $i ).
tff(decl_45,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_46,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_47,type,
esk11_2: ( $i * $i ) > $i ).
tff(decl_48,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_49,type,
esk13_2: ( $i * $i ) > $i ).
tff(decl_50,type,
esk14_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_51,type,
esk15_2: ( $i * $i ) > $i ).
tff(decl_52,type,
esk16_2: ( $i * $i ) > $i ).
tff(decl_53,type,
esk17_1: $i > $i ).
tff(decl_54,type,
esk18_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_55,type,
esk19_5: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_56,type,
esk20_1: $i > $i ).
tff(decl_57,type,
esk21_3: ( $i * $i * $i ) > $i ).
tff(decl_58,type,
esk22_2: ( $i * $i ) > $i ).
tff(decl_59,type,
esk23_2: ( $i * $i ) > $i ).
tff(decl_60,type,
esk24_2: ( $i * $i ) > $i ).
tff(decl_61,type,
esk25_0: $i ).
tff(decl_62,type,
esk26_0: $i ).
fof(between_c_defn,axiom,
! [X1,X3,X5,X7] :
( between_c(X1,X3,X5,X7)
<=> ( X3 != X7
& ? [X8] :
( part_of(X8,X1)
& end_point(X3,X8)
& end_point(X7,X8)
& inner_point(X5,X8) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+1.ax',between_c_defn) ).
fof(o3,axiom,
! [X3,X5,X7,X9] :
( between_o(X9,X3,X5,X7)
<=> ? [X1] :
( ! [X3] :
( incident_o(X3,X9)
<=> incident_c(X3,X1) )
& between_c(X1,X3,X5,X7) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+2.ax',o3) ).
fof(between_o_defn,axiom,
! [X9,X3,X5,X7] :
( between_o(X9,X3,X5,X7)
<=> ( ( ordered_by(X9,X3,X5)
& ordered_by(X9,X5,X7) )
| ( ordered_by(X9,X7,X5)
& ordered_by(X9,X5,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+2.ax',between_o_defn) ).
fof(theorem_4_4,conjecture,
! [X9,X3] : ~ ordered_by(X9,X3,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_4_4) ).
fof(c_0_4,plain,
! [X85,X86,X87,X88,X90,X91,X92,X93,X94] :
( ( X86 != X88
| ~ between_c(X85,X86,X87,X88) )
& ( part_of(esk14_4(X85,X86,X87,X88),X85)
| ~ between_c(X85,X86,X87,X88) )
& ( end_point(X86,esk14_4(X85,X86,X87,X88))
| ~ between_c(X85,X86,X87,X88) )
& ( end_point(X88,esk14_4(X85,X86,X87,X88))
| ~ between_c(X85,X86,X87,X88) )
& ( inner_point(X87,esk14_4(X85,X86,X87,X88))
| ~ between_c(X85,X86,X87,X88) )
& ( X91 = X93
| ~ part_of(X94,X90)
| ~ end_point(X91,X94)
| ~ end_point(X93,X94)
| ~ inner_point(X92,X94)
| between_c(X90,X91,X92,X93) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[between_c_defn])])])])])]) ).
cnf(c_0_5,plain,
( X1 != X2
| ~ between_c(X3,X1,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X118,X119,X120,X121,X123,X124,X125,X126,X127,X128,X129] :
( ( ~ incident_o(X123,X121)
| incident_c(X123,esk18_4(X118,X119,X120,X121))
| ~ between_o(X121,X118,X119,X120) )
& ( ~ incident_c(X124,esk18_4(X118,X119,X120,X121))
| incident_o(X124,X121)
| ~ between_o(X121,X118,X119,X120) )
& ( between_c(esk18_4(X118,X119,X120,X121),X118,X119,X120)
| ~ between_o(X121,X118,X119,X120) )
& ( ~ incident_o(esk19_5(X125,X126,X127,X128,X129),X128)
| ~ incident_c(esk19_5(X125,X126,X127,X128,X129),X129)
| ~ between_c(X129,X125,X126,X127)
| between_o(X128,X125,X126,X127) )
& ( incident_o(esk19_5(X125,X126,X127,X128,X129),X128)
| incident_c(esk19_5(X125,X126,X127,X128,X129),X129)
| ~ between_c(X129,X125,X126,X127)
| between_o(X128,X125,X126,X127) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[o3])])])])])]) ).
cnf(c_0_7,plain,
~ between_c(X1,X2,X3,X2),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( between_c(esk18_4(X1,X2,X3,X4),X1,X2,X3)
| ~ between_o(X4,X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X95,X96,X97,X98] :
( ( ordered_by(X95,X98,X97)
| ordered_by(X95,X96,X97)
| ~ between_o(X95,X96,X97,X98) )
& ( ordered_by(X95,X97,X96)
| ordered_by(X95,X96,X97)
| ~ between_o(X95,X96,X97,X98) )
& ( ordered_by(X95,X98,X97)
| ordered_by(X95,X97,X98)
| ~ between_o(X95,X96,X97,X98) )
& ( ordered_by(X95,X97,X96)
| ordered_by(X95,X97,X98)
| ~ between_o(X95,X96,X97,X98) )
& ( ~ ordered_by(X95,X96,X97)
| ~ ordered_by(X95,X97,X98)
| between_o(X95,X96,X97,X98) )
& ( ~ ordered_by(X95,X98,X97)
| ~ ordered_by(X95,X97,X96)
| between_o(X95,X96,X97,X98) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[between_o_defn])])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X9,X3] : ~ ordered_by(X9,X3,X3),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[theorem_4_4])]) ).
cnf(c_0_11,plain,
~ between_o(X1,X2,X3,X2),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( between_o(X1,X4,X3,X2)
| ~ ordered_by(X1,X2,X3)
| ~ ordered_by(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
ordered_by(esk25_0,esk26_0,esk26_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_14,plain,
( ~ ordered_by(X1,X2,X3)
| ~ ordered_by(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
ordered_by(esk25_0,esk26_0,esk26_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO117+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 23:25:57 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.57 start to proof: theBenchmark
% 0.21/0.61 % Version : CSE_E---1.5
% 0.21/0.61 % Problem : theBenchmark.p
% 0.21/0.61 % Proof found
% 0.21/0.61 % SZS status Theorem for theBenchmark.p
% 0.21/0.61 % SZS output start Proof
% See solution above
% 0.21/0.62 % Total time : 0.032000 s
% 0.21/0.62 % SZS output end Proof
% 0.21/0.62 % Total time : 0.036000 s
%------------------------------------------------------------------------------