%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR070+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:16:30 PM UTC 2026
% Result : Theorem 0.30s 0.62s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 46 ( 21 ~; 15 |; 2 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-3 aty)
% Number of variables : 32 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query170,conjecture,
( mtvisible(c_tptp_spindlecollectormt)
=> tptptypes_5_802(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query170) ).
fof(ax2_1876,axiom,
! [X3,X4] :
( tptptypes_6_818(X3,X4)
=> tptptypes_5_802(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1876) ).
fof(ax2_596,axiom,
! [X3,X4] :
( tptptypes_7_819(X3,X4)
=> tptptypes_6_818(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_596) ).
fof(ax2_2522,axiom,
! [X3,X4] :
( tptptypes_8_823(X3,X4)
=> tptptypes_7_819(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_2522) ).
fof(ax2_2254,axiom,
! [X3,X4] :
( tptptypes_9_824(X3,X4)
=> tptptypes_8_823(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_2254) ).
fof(ax2_7997,axiom,
! [X21,X22] :
( ( genlmt(X21,X22)
& mtvisible(X21) )
=> mtvisible(X22) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_7997) ).
fof(ax2_602,axiom,
( mtvisible(c_tptp_member2668_mt)
=> tptptypes_9_824(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_602) ).
fof(ax2_254,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2668_mt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_254) ).
fof(c_0_8,negated_conjecture,
~ ( mtvisible(c_tptp_spindlecollectormt)
=> tptptypes_5_802(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886) ),
inference(assume_negation,[status(cth)],[query170]) ).
fof(c_0_9,negated_conjecture,
( ~ tptptypes_5_802(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886)
& mtvisible(c_tptp_spindlecollectormt) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
fof(c_0_10,plain,
! [X23,X24] :
( tptptypes_5_802(X23,X24)
| ~ tptptypes_6_818(X23,X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1876])])]) ).
cnf(c_0_11,negated_conjecture,
~ tptptypes_5_802(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( ~ tptptypes_6_818(X1,X2)
| tptptypes_5_802(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X42,X43] :
( tptptypes_6_818(X42,X43)
| ~ tptptypes_7_819(X42,X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_596])])]) ).
fof(c_0_14,plain,
! [X111,X112] :
( tptptypes_7_819(X111,X112)
| ~ tptptypes_8_823(X111,X112) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_2522])])]) ).
fof(c_0_15,plain,
! [X50,X51] :
( tptptypes_8_823(X50,X51)
| ~ tptptypes_9_824(X50,X51) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_2254])])]) ).
fof(c_0_16,plain,
! [X40,X41] :
( mtvisible(X41)
| ~ genlmt(X40,X41)
| ~ mtvisible(X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])])]) ).
cnf(c_0_17,negated_conjecture,
~ tptptypes_6_818(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( ~ tptptypes_7_819(X1,X2)
| tptptypes_6_818(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ tptptypes_8_823(X1,X2)
| tptptypes_7_819(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ tptptypes_9_824(X1,X2)
| tptptypes_8_823(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
( tptptypes_9_824(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886)
| ~ mtvisible(c_tptp_member2668_mt) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_602])]) ).
cnf(c_0_22,plain,
( ~ genlmt(X1,X2)
| ~ mtvisible(X1)
| mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2668_mt),
inference(split_conjunct,[status(thm)],[ax2_254]) ).
cnf(c_0_24,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
~ tptptypes_7_819(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
( ~ tptptypes_9_824(X1,X2)
| tptptypes_7_819(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( ~ mtvisible(c_tptp_member2668_mt)
| tptptypes_9_824(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
mtvisible(c_tptp_member2668_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
~ tptptypes_9_824(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR070+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n013.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 : Mon Sep 21 14:44:20 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.30/0.62 % Version: 3.5.1
% 0.30/0.62 % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.30/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.62 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.30/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.62 % Starting sh5l with 300s (1) cores
% 0.30/0.62 % new_bool_1 with pid 1012821 completed with status 0
% 0.30/0.62 % Result found by new_bool_1
% 0.30/0.62 % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.30/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.62 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.30/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.30/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/0.62 % Search class: FHHNM-FFMS32-SFFFFFNN
% 0.30/0.62 % partial match(2): FGHSM-FFMS32-SFFFFFNN
% 0.30/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.62 % SubtermCWHack with pid 1012825 completed with status 0
% 0.30/0.62 % Result found by SubtermCWHack
% 0.30/0.62 % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.30/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.62 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.30/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.30/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/0.62 % Search class: FHHNM-FFMS32-SFFFFFNN
% 0.30/0.62 % partial match(2): FGHSM-FFMS32-SFFFFFNN
% 0.30/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.62 % Preprocessing time : 0.006 s
% 0.30/0.62
% 0.30/0.62 % Proof found!
% 0.30/0.62 % SZS status Theorem
% 0.30/0.62 % SZS output start CNFRefutation
% See solution above
% 0.30/0.62 % Parsed axioms : 8006
% 0.30/0.62 % Removed by relevancy pruning/SinE : 7949
% 0.30/0.62 % Initial clauses : 58
% 0.30/0.62 % Removed in clause preprocessing : 0
% 0.30/0.62 % Initial clauses in saturation : 58
% 0.30/0.62 % Processed clauses : 71
% 0.30/0.62 % ...of these trivial : 1
% 0.30/0.62 % ...subsumed : 20
% 0.30/0.62 % ...remaining for further processing : 49
% 0.30/0.62 % Other redundant clauses eliminated : 0
% 0.30/0.62 % Clauses deleted for lack of memory : 0
% 0.30/0.62 % Backward-subsumed : 0
% 0.30/0.62 % Backward-rewritten : 0
% 0.30/0.62 % Generated clauses : 26
% 0.30/0.62 % ...of the previous two non-redundant : 21
% 0.30/0.62 % ...aggressively subsumed : 0
% 0.30/0.62 % Contextual simplify-reflections : 0
% 0.30/0.62 % Paramodulations : 26
% 0.30/0.62 % Factorizations : 0
% 0.30/0.62 % NegExts : 0
% 0.30/0.62 % Equation resolutions : 0
% 0.30/0.62 % Disequality decompositions : 0
% 0.30/0.62 % Total rewrite steps : 7
% 0.30/0.62 % ...of those cached : 2
% 0.30/0.62 % Propositional unsat checks : 0
% 0.30/0.62 % Propositional check models : 0
% 0.30/0.62 % Propositional check unsatisfiable : 0
% 0.30/0.62 % Propositional clauses : 0
% 0.30/0.62 % Propositional clauses after purity: 0
% 0.30/0.62 % Propositional unsat core size : 0
% 0.30/0.62 % Propositional preprocessing time : 0.000
% 0.30/0.62 % Propositional encoding time : 0.000
% 0.30/0.62 % Propositional solver time : 0.000
% 0.30/0.62 % Success case prop preproc time : 0.000
% 0.30/0.62 % Success case prop encoding time : 0.000
% 0.30/0.62 % Success case prop solver time : 0.000
% 0.30/0.62 % Current number of processed clauses : 49
% 0.30/0.62 % Positive orientable unit clauses : 18
% 0.30/0.62 % Positive unorientable unit clauses: 0
% 0.30/0.62 % Negative unit clauses : 4
% 0.30/0.62 % Non-unit-clauses : 27
% 0.30/0.62 % Current number of unprocessed clauses: 8
% 0.30/0.62 % ...number of literals in the above : 17
% 0.30/0.62 % Current number of archived formulas : 0
% 0.30/0.62 % Current number of archived clauses : 0
% 0.30/0.62 % Clause-clause subsumption calls (NU) : 238
% 0.30/0.62 % Rec. Clause-clause subsumption calls : 197
% 0.30/0.62 % Non-unit clause-clause subsumptions : 20
% 0.30/0.62 % Unit Clause-clause subsumption calls : 4
% 0.30/0.62 % Rewrite failures with RHS unbound : 0
% 0.30/0.62 % BW rewrite match attempts : 0
% 0.30/0.62 % BW rewrite match successes : 0
% 0.30/0.62 % Condensation attempts : 0
% 0.30/0.62 % Condensation successes : 0
% 0.30/0.62 % Termbank termtop insertions : 53960
% 0.30/0.62 % Search garbage collected termcells : 31210
% 0.30/0.62
% 0.30/0.62 % -------------------------------------------------
% 0.30/0.62 % User time : 0.034 s
% 0.30/0.62 % System time : 0.028 s
% 0.30/0.62 % Total time : 0.062 s
% 0.30/0.62 % Maximum resident set size: 20032 pages
% 0.30/0.62
% 0.30/0.62 % -------------------------------------------------
% 0.30/0.62 % User time : 0.147 s
% 0.30/0.62 % System time : 0.044 s
% 0.30/0.62 % Total time : 0.192 s
% 0.30/0.62 % Maximum resident set size: 11008 pages
% 0.30/0.62 % E exiting
%------------------------------------------------------------------------------