TSTP Solution File: GEO112+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO112+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:33:48 EDT 2023
% Result : Theorem 0.15s 0.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 21 ( 9 unt; 0 def)
% Number of atoms : 58 ( 7 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 65 ( 28 ~; 24 |; 10 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 53 ( 4 sgn; 21 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(theorem_3_8_2,conjecture,
! [X1,X3,X5,X7] :
( between_c(X1,X3,X5,X7)
=> between_c(X1,X7,X5,X3) ),
file('/export/starexec/sandbox/tmp/tmp.fxrj7LmApT/E---3.1_14952.p',theorem_3_8_2) ).
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/sandbox/tmp/tmp.fxrj7LmApT/E---3.1_14952.p',between_c_defn) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X3,X5,X7] :
( between_c(X1,X3,X5,X7)
=> between_c(X1,X7,X5,X3) ),
inference(assume_negation,[status(cth)],[theorem_3_8_2]) ).
fof(c_0_3,plain,
! [X82,X83,X84,X85,X87,X88,X89,X90,X91] :
( ( X83 != X85
| ~ between_c(X82,X83,X84,X85) )
& ( part_of(esk14_4(X82,X83,X84,X85),X82)
| ~ between_c(X82,X83,X84,X85) )
& ( end_point(X83,esk14_4(X82,X83,X84,X85))
| ~ between_c(X82,X83,X84,X85) )
& ( end_point(X85,esk14_4(X82,X83,X84,X85))
| ~ between_c(X82,X83,X84,X85) )
& ( inner_point(X84,esk14_4(X82,X83,X84,X85))
| ~ between_c(X82,X83,X84,X85) )
& ( X88 = X90
| ~ part_of(X91,X87)
| ~ end_point(X88,X91)
| ~ end_point(X90,X91)
| ~ inner_point(X89,X91)
| between_c(X87,X88,X89,X90) ) ),
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])])])])])]) ).
fof(c_0_4,negated_conjecture,
( between_c(esk15_0,esk16_0,esk17_0,esk18_0)
& ~ between_c(esk15_0,esk18_0,esk17_0,esk16_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_5,plain,
( inner_point(X1,esk14_4(X2,X3,X1,X4))
| ~ between_c(X2,X3,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
between_c(esk15_0,esk16_0,esk17_0,esk18_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( X1 = X2
| between_c(X4,X1,X5,X2)
| ~ part_of(X3,X4)
| ~ end_point(X1,X3)
| ~ end_point(X2,X3)
| ~ inner_point(X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
inner_point(esk17_0,esk14_4(esk15_0,esk16_0,esk17_0,esk18_0)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( end_point(X1,esk14_4(X2,X1,X3,X4))
| ~ between_c(X2,X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,plain,
( end_point(X1,esk14_4(X2,X3,X4,X1))
| ~ between_c(X2,X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,plain,
( part_of(esk14_4(X1,X2,X3,X4),X1)
| ~ between_c(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
~ between_c(esk15_0,esk18_0,esk17_0,esk16_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( X1 = X2
| between_c(X3,X1,esk17_0,X2)
| ~ end_point(X2,esk14_4(esk15_0,esk16_0,esk17_0,esk18_0))
| ~ end_point(X1,esk14_4(esk15_0,esk16_0,esk17_0,esk18_0))
| ~ part_of(esk14_4(esk15_0,esk16_0,esk17_0,esk18_0),X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
end_point(esk16_0,esk14_4(esk15_0,esk16_0,esk17_0,esk18_0)),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_15,negated_conjecture,
end_point(esk18_0,esk14_4(esk15_0,esk16_0,esk17_0,esk18_0)),
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_16,negated_conjecture,
part_of(esk14_4(esk15_0,esk16_0,esk17_0,esk18_0),esk15_0),
inference(spm,[status(thm)],[c_0_11,c_0_6]) ).
cnf(c_0_17,plain,
( X1 != X2
| ~ between_c(X3,X1,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_18,negated_conjecture,
esk18_0 = esk16_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_19,plain,
~ between_c(X1,X2,X3,X2),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : GEO112+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n007.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 06:13:55 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.fxrj7LmApT/E---3.1_14952.p
% 0.15/0.47 # Version: 3.1pre001
% 0.15/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 # Starting sh5l with 300s (1) cores
% 0.15/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15029 completed with status 0
% 0.15/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 # No SInE strategy applied
% 0.15/0.47 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.15/0.47 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 0.15/0.47 # Starting G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with 151s (1) cores
% 0.15/0.47 # Starting new_bool_3 with 151s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 151s (1) cores
% 0.15/0.47 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 146s (1) cores
% 0.15/0.47 # G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 15036 completed with status 0
% 0.15/0.47 # Result found by G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.15/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 # No SInE strategy applied
% 0.15/0.47 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.15/0.47 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 0.15/0.47 # Starting G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with 151s (1) cores
% 0.15/0.47 # Preprocessing time : 0.001 s
% 0.15/0.47 # Presaturation interreduction done
% 0.15/0.47
% 0.15/0.47 # Proof found!
% 0.15/0.47 # SZS status Theorem
% 0.15/0.47 # SZS output start CNFRefutation
% See solution above
% 0.15/0.47 # Parsed axioms : 18
% 0.15/0.47 # Removed by relevancy pruning/SinE : 0
% 0.15/0.47 # Initial clauses : 51
% 0.15/0.47 # Removed in clause preprocessing : 0
% 0.15/0.47 # Initial clauses in saturation : 51
% 0.15/0.47 # Processed clauses : 415
% 0.15/0.47 # ...of these trivial : 0
% 0.15/0.47 # ...subsumed : 132
% 0.15/0.47 # ...remaining for further processing : 283
% 0.15/0.47 # Other redundant clauses eliminated : 20
% 0.15/0.47 # Clauses deleted for lack of memory : 0
% 0.15/0.47 # Backward-subsumed : 2
% 0.15/0.47 # Backward-rewritten : 33
% 0.15/0.47 # Generated clauses : 1580
% 0.15/0.47 # ...of the previous two non-redundant : 1264
% 0.15/0.47 # ...aggressively subsumed : 0
% 0.15/0.47 # Contextual simplify-reflections : 5
% 0.15/0.47 # Paramodulations : 1525
% 0.15/0.47 # Factorizations : 30
% 0.15/0.47 # NegExts : 0
% 0.15/0.47 # Equation resolutions : 25
% 0.15/0.47 # Total rewrite steps : 404
% 0.15/0.47 # Propositional unsat checks : 0
% 0.15/0.47 # Propositional check models : 0
% 0.15/0.47 # Propositional check unsatisfiable : 0
% 0.15/0.47 # Propositional clauses : 0
% 0.15/0.47 # Propositional clauses after purity: 0
% 0.15/0.47 # Propositional unsat core size : 0
% 0.15/0.47 # Propositional preprocessing time : 0.000
% 0.15/0.47 # Propositional encoding time : 0.000
% 0.15/0.47 # Propositional solver time : 0.000
% 0.15/0.47 # Success case prop preproc time : 0.000
% 0.15/0.47 # Success case prop encoding time : 0.000
% 0.15/0.47 # Success case prop solver time : 0.000
% 0.15/0.47 # Current number of processed clauses : 196
% 0.15/0.47 # Positive orientable unit clauses : 22
% 0.15/0.47 # Positive unorientable unit clauses: 0
% 0.15/0.47 # Negative unit clauses : 4
% 0.15/0.47 # Non-unit-clauses : 170
% 0.15/0.47 # Current number of unprocessed clauses: 925
% 0.15/0.47 # ...number of literals in the above : 4544
% 0.15/0.47 # Current number of archived formulas : 0
% 0.15/0.47 # Current number of archived clauses : 86
% 0.15/0.47 # Clause-clause subsumption calls (NU) : 10061
% 0.15/0.47 # Rec. Clause-clause subsumption calls : 3866
% 0.15/0.47 # Non-unit clause-clause subsumptions : 134
% 0.15/0.47 # Unit Clause-clause subsumption calls : 427
% 0.15/0.47 # Rewrite failures with RHS unbound : 0
% 0.15/0.47 # BW rewrite match attempts : 19
% 0.15/0.47 # BW rewrite match successes : 1
% 0.15/0.47 # Condensation attempts : 0
% 0.15/0.47 # Condensation successes : 0
% 0.15/0.47 # Termbank termtop insertions : 29677
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.044 s
% 0.15/0.47 # System time : 0.004 s
% 0.15/0.47 # Total time : 0.048 s
% 0.15/0.47 # Maximum resident set size: 1868 pages
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.213 s
% 0.15/0.47 # System time : 0.011 s
% 0.15/0.47 # Total time : 0.224 s
% 0.15/0.47 # Maximum resident set size: 1700 pages
% 0.15/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------