%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO566+1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:30:23 PM UTC 2026
% Result : Theorem 0.17s 0.53s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 4
% Syntax : Number of formulae : 58 ( 37 unt; 0 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 11 ( 1 avg)
% Number of connectives : 71 ( 20 ~; 17 |; 29 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 55 ( 0 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(exemplo6GDDFULL214028,conjecture,
! [X1,X2,X3,X6,X14,X19,X10,X9] :
( ( coll(X9,X1,X3)
& perp(X9,X6,X1,X3)
& coll(X10,X1,X14)
& perp(X10,X6,X1,X14)
& coll(X19,X2,X3)
& perp(X19,X6,X2,X3)
& perp(X1,X3,X2,X14)
& perp(X2,X3,X1,X14)
& coll(X6,X1,X2)
& perp(X6,X3,X1,X2) )
=> coll(X9,X10,X19) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exemplo6GDDFULL214028) ).
fof(ruleD1,axiom,
! [X1,X2,X3] :
( coll(X1,X2,X3)
=> coll(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO012+0.ax',ruleD1) ).
fof(ruleD3,axiom,
! [X1,X2,X3,X4] :
( ( coll(X1,X2,X4)
& coll(X1,X2,X3) )
=> coll(X3,X4,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO012+0.ax',ruleD3) ).
fof(ruleD2,axiom,
! [X1,X2,X3] :
( coll(X1,X2,X3)
=> coll(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO012+0.ax',ruleD2) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3,X6,X14,X19,X10,X9] :
( ( coll(X9,X1,X3)
& perp(X9,X6,X1,X3)
& coll(X10,X1,X14)
& perp(X10,X6,X1,X14)
& coll(X19,X2,X3)
& perp(X19,X6,X2,X3)
& perp(X1,X3,X2,X14)
& perp(X2,X3,X1,X14)
& coll(X6,X1,X2)
& perp(X6,X3,X1,X2) )
=> coll(X9,X10,X19) ),
inference(assume_negation,[status(cth)],[exemplo6GDDFULL214028]) ).
fof(c_0_5,plain,
! [X28,X29,X30] :
( coll(X28,X30,X29)
| ~ coll(X28,X29,X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD1])])]) ).
fof(c_0_6,negated_conjecture,
( ~ coll(esk8_0,esk7_0,esk6_0)
& coll(esk8_0,esk1_0,esk3_0)
& perp(esk8_0,esk4_0,esk1_0,esk3_0)
& coll(esk7_0,esk1_0,esk5_0)
& perp(esk7_0,esk4_0,esk1_0,esk5_0)
& coll(esk6_0,esk2_0,esk3_0)
& perp(esk6_0,esk4_0,esk2_0,esk3_0)
& perp(esk1_0,esk3_0,esk2_0,esk5_0)
& perp(esk2_0,esk3_0,esk1_0,esk5_0)
& coll(esk4_0,esk1_0,esk2_0)
& perp(esk4_0,esk3_0,esk1_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,plain,
! [X34,X35,X36,X37] :
( coll(X36,X37,X34)
| ~ coll(X34,X35,X37)
| ~ coll(X34,X35,X36) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD3])])]) ).
cnf(c_0_8,plain,
( ~ coll(X1,X2,X3)
| coll(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
coll(esk8_0,esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X31,X32,X33] :
( coll(X32,X31,X33)
| ~ coll(X31,X32,X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD2])])]) ).
cnf(c_0_11,negated_conjecture,
coll(esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( ~ coll(X1,X2,X4)
| ~ coll(X1,X2,X3)
| coll(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
coll(esk8_0,esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
( ~ coll(X1,X2,X3)
| coll(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
coll(esk4_0,esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ coll(esk8_0,esk3_0,X1)
| coll(X1,esk1_0,esk8_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
coll(esk2_0,esk4_0,esk1_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
coll(esk1_0,esk1_0,esk8_0),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( ~ coll(esk2_0,esk4_0,X1)
| coll(X1,esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( ~ coll(esk1_0,esk1_0,X1)
| coll(X1,esk8_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
coll(esk1_0,esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
coll(esk6_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
coll(esk2_0,esk8_0,esk1_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
coll(esk2_0,esk6_0,esk3_0),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
coll(esk8_0,esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_14,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
coll(esk2_0,esk3_0,esk6_0),
inference(spm,[status(thm)],[c_0_8,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( ~ coll(esk8_0,esk1_0,X1)
| coll(X1,esk3_0,esk8_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_28,negated_conjecture,
coll(esk8_0,esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_8,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
coll(esk3_0,esk2_0,esk6_0),
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
coll(esk2_0,esk3_0,esk8_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( ~ coll(esk3_0,esk2_0,X1)
| coll(X1,esk6_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
coll(esk3_0,esk2_0,esk8_0),
inference(spm,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
coll(esk8_0,esk6_0,esk3_0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
coll(esk8_0,esk3_0,esk6_0),
inference(spm,[status(thm)],[c_0_8,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
coll(esk6_0,esk1_0,esk8_0),
inference(spm,[status(thm)],[c_0_16,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
coll(esk7_0,esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_37,negated_conjecture,
coll(esk1_0,esk8_0,esk1_0),
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_38,negated_conjecture,
coll(esk1_0,esk6_0,esk8_0),
inference(spm,[status(thm)],[c_0_14,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
coll(esk7_0,esk5_0,esk1_0),
inference(spm,[status(thm)],[c_0_8,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( ~ coll(esk1_0,esk8_0,X1)
| coll(X1,esk1_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
coll(esk1_0,esk8_0,esk6_0),
inference(spm,[status(thm)],[c_0_8,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( ~ coll(esk7_0,esk5_0,X1)
| coll(X1,esk1_0,esk7_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
coll(esk6_0,esk1_0,esk1_0),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
coll(esk1_0,esk1_0,esk7_0),
inference(spm,[status(thm)],[c_0_42,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
coll(esk1_0,esk6_0,esk1_0),
inference(spm,[status(thm)],[c_0_14,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( ~ coll(esk1_0,esk1_0,X1)
| coll(X1,esk7_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
coll(esk1_0,esk1_0,esk6_0),
inference(spm,[status(thm)],[c_0_8,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
coll(esk7_0,esk8_0,esk1_0),
inference(spm,[status(thm)],[c_0_20,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
coll(esk6_0,esk7_0,esk1_0),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
coll(esk7_0,esk1_0,esk8_0),
inference(spm,[status(thm)],[c_0_8,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
coll(esk7_0,esk6_0,esk1_0),
inference(spm,[status(thm)],[c_0_14,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
( ~ coll(esk7_0,esk1_0,X1)
| coll(X1,esk8_0,esk7_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
coll(esk7_0,esk1_0,esk6_0),
inference(spm,[status(thm)],[c_0_8,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
coll(esk6_0,esk8_0,esk7_0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
coll(esk8_0,esk6_0,esk7_0),
inference(spm,[status(thm)],[c_0_14,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
~ coll(esk8_0,esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_55]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO566+1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n020.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 17:38:02 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.53 % Version: 3.5.1
% 0.17/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.53 % Starting sh5l with 300s (1) cores
% 0.17/0.53 % new_bool_3 with pid 887545 completed with status 0
% 0.17/0.53 % Result found by new_bool_3
% 0.17/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.53 % Search class: FGUNF-FFMM33-SFFFFFNN
% 0.17/0.53 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.17/0.53 % SubtermCWHack with pid 887548 completed with status 0
% 0.17/0.53 % Result found by SubtermCWHack
% 0.17/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.53 % Search class: FGUNF-FFMM33-SFFFFFNN
% 0.17/0.53 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.17/0.53 % Preprocessing time : 0.001 s
% 0.17/0.53
% 0.17/0.53 % Proof found!
% 0.17/0.53 % SZS status Theorem
% 0.17/0.53 % SZS output start CNFRefutation
% See solution above
% 0.17/0.53 % Parsed axioms : 95
% 0.17/0.53 % Removed by relevancy pruning/SinE : 43
% 0.17/0.53 % Initial clauses : 77
% 0.17/0.53 % Removed in clause preprocessing : 0
% 0.17/0.53 % Initial clauses in saturation : 77
% 0.17/0.53 % Processed clauses : 2204
% 0.17/0.53 % ...of these trivial : 251
% 0.17/0.53 % ...subsumed : 1
% 0.17/0.53 % ...remaining for further processing : 1952
% 0.17/0.53 % Other redundant clauses eliminated : 0
% 0.17/0.53 % Clauses deleted for lack of memory : 0
% 0.17/0.53 % Backward-subsumed : 0
% 0.17/0.53 % Backward-rewritten : 0
% 0.17/0.53 % Generated clauses : 9452
% 0.17/0.53 % ...of the previous two non-redundant : 6045
% 0.17/0.53 % ...aggressively subsumed : 0
% 0.17/0.53 % Contextual simplify-reflections : 0
% 0.17/0.53 % Paramodulations : 9452
% 0.17/0.53 % Factorizations : 0
% 0.17/0.53 % NegExts : 0
% 0.17/0.53 % Equation resolutions : 0
% 0.17/0.53 % Disequality decompositions : 0
% 0.17/0.53 % Total rewrite steps : 3691
% 0.17/0.53 % ...of those cached : 2018
% 0.17/0.53 % Propositional unsat checks : 0
% 0.17/0.53 % Propositional check models : 0
% 0.17/0.53 % Propositional check unsatisfiable : 0
% 0.17/0.53 % Propositional clauses : 0
% 0.17/0.53 % Propositional clauses after purity: 0
% 0.17/0.53 % Propositional unsat core size : 0
% 0.17/0.53 % Propositional preprocessing time : 0.000
% 0.17/0.53 % Propositional encoding time : 0.000
% 0.17/0.53 % Propositional solver time : 0.000
% 0.17/0.53 % Success case prop preproc time : 0.000
% 0.17/0.53 % Success case prop encoding time : 0.000
% 0.17/0.53 % Success case prop solver time : 0.000
% 0.17/0.53 % Current number of processed clauses : 1952
% 0.17/0.53 % Positive orientable unit clauses : 1695
% 0.17/0.53 % Positive unorientable unit clauses: 0
% 0.17/0.53 % Negative unit clauses : 1
% 0.17/0.53 % Non-unit-clauses : 256
% 0.17/0.53 % Current number of unprocessed clauses: 3918
% 0.17/0.53 % ...number of literals in the above : 11725
% 0.17/0.53 % Current number of archived formulas : 0
% 0.17/0.53 % Current number of archived clauses : 0
% 0.17/0.53 % Clause-clause subsumption calls (NU) : 5043
% 0.17/0.53 % Rec. Clause-clause subsumption calls : 3442
% 0.17/0.53 % Non-unit clause-clause subsumptions : 1
% 0.17/0.53 % Unit Clause-clause subsumption calls : 3883
% 0.17/0.53 % Rewrite failures with RHS unbound : 0
% 0.17/0.53 % BW rewrite match attempts : 9857
% 0.17/0.53 % BW rewrite match successes : 0
% 0.17/0.53 % Condensation attempts : 0
% 0.17/0.53 % Condensation successes : 0
% 0.17/0.53 % Termbank termtop insertions : 128705
% 0.17/0.53 % Search garbage collected termcells : 2144
% 0.17/0.53
% 0.17/0.53 % -------------------------------------------------
% 0.17/0.53 % User time : 0.073 s
% 0.17/0.53 % System time : 0.013 s
% 0.17/0.53 % Total time : 0.086 s
% 0.17/0.53 % Maximum resident set size: 3996 pages
% 0.17/0.53
% 0.17/0.53 % -------------------------------------------------
% 0.17/0.53 % User time : 0.076 s
% 0.17/0.53 % System time : 0.019 s
% 0.17/0.53 % Total time : 0.094 s
% 0.17/0.53 % Maximum resident set size: 5120 pages
% 0.17/0.53 % E exiting
%------------------------------------------------------------------------------