%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR066+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:27 PM UTC 2026
% Result : Theorem 0.16s 0.52s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 19 ~; 14 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 27 ( 0 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query116,conjecture,
? [X13] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptpcol_16_25972(X13)
& tptp_8_271(X13,c_theprototypicalshavingrazor_manual) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query116) ).
fof(ax1_563,axiom,
! [X13] :
( isa(X13,c_tptpcol_16_25972)
=> tptpcol_16_25972(X13) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_563) ).
fof(ax1_391,axiom,
! [X7] :
( shavingrazor_manual(X7)
=> tptp_8_271(f_relationexistsallfn(X7,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X7) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_391) ).
fof(ax1_64,axiom,
! [X7,X8,X3,X9] :
( ( relationexistsall(X3,X9,X8)
& isa(X7,X8) )
=> isa(f_relationexistsallfn(X7,X3,X9,X8),X9) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_64) ).
fof(ax1_913,axiom,
! [X13] :
( shavingrazor_manual(X13)
=> isa(X13,c_shavingrazor_manual) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_913) ).
fof(ax1_97,axiom,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_97) ).
fof(ax1_392,axiom,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_392) ).
fof(c_0_7,negated_conjecture,
~ ? [X13] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptpcol_16_25972(X13)
& tptp_8_271(X13,c_theprototypicalshavingrazor_manual) ) ),
inference(assume_negation,[status(cth)],[query116]) ).
fof(c_0_8,negated_conjecture,
! [X22] :
( ( ~ tptpcol_16_25972(X22)
| ~ tptp_8_271(X22,c_theprototypicalshavingrazor_manual) )
& mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_9,plain,
! [X23] :
( tptpcol_16_25972(X23)
| ~ isa(X23,c_tptpcol_16_25972) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_563])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ tptpcol_16_25972(X1)
| ~ tptp_8_271(X1,c_theprototypicalshavingrazor_manual) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( ~ isa(X1,c_tptpcol_16_25972)
| tptpcol_16_25972(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X25] :
( tptp_8_271(f_relationexistsallfn(X25,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X25)
| ~ shavingrazor_manual(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_391])])]) ).
fof(c_0_13,plain,
! [X44,X45,X46,X47] :
( isa(f_relationexistsallfn(X44,X46,X47,X45),X47)
| ~ relationexistsall(X46,X47,X45)
| ~ isa(X44,X45) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_64])])]) ).
fof(c_0_14,plain,
! [X75] :
( isa(X75,c_shavingrazor_manual)
| ~ shavingrazor_manual(X75) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_913])])]) ).
cnf(c_0_15,negated_conjecture,
( ~ isa(X1,c_tptpcol_16_25972)
| ~ tptp_8_271(X1,c_theprototypicalshavingrazor_manual) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ shavingrazor_manual(X1)
| tptp_8_271(f_relationexistsallfn(X1,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
inference(split_conjunct,[status(thm)],[ax1_97]) ).
cnf(c_0_18,plain,
( ~ relationexistsall(X3,X4,X2)
| ~ isa(X1,X2)
| isa(f_relationexistsallfn(X1,X3,X4,X2),X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
inference(split_conjunct,[status(thm)],[ax1_392]) ).
cnf(c_0_20,plain,
( ~ shavingrazor_manual(X1)
| isa(X1,c_shavingrazor_manual) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
~ isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_22,plain,
( ~ isa(X1,c_shavingrazor_manual)
| isa(f_relationexistsallfn(X1,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR066+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n017.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 14:38:28 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.16/0.52 % Version: 3.5.1
% 0.16/0.52 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.16/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.52 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.16/0.52 % Starting new_bool_3 with 600s (2) cores
% 0.16/0.52 % Starting new_bool_1 with 600s (2) cores
% 0.16/0.52 % Starting sh5l with 300s (1) cores
% 0.16/0.52 % sh5l with pid 2564103 completed with status 0
% 0.16/0.52 % Result found by sh5l
% 0.16/0.52 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.16/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.52 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.16/0.52 % Starting new_bool_3 with 600s (2) cores
% 0.16/0.52 % Starting new_bool_1 with 600s (2) cores
% 0.16/0.52 % Starting sh5l with 300s (1) cores
% 0.16/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/0.52 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.52 % Search class: FHHNM-FSLM31-MFFFFFNN
% 0.16/0.52 % partial match(1): FHHNM-SSLM31-MFFFFFNN
% 0.16/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.52 % SubtermCWHack with pid 2564108 completed with status 0
% 0.16/0.52 % Result found by SubtermCWHack
% 0.16/0.52 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.16/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.52 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.16/0.52 % Starting new_bool_3 with 600s (2) cores
% 0.16/0.52 % Starting new_bool_1 with 600s (2) cores
% 0.16/0.52 % Starting sh5l with 300s (1) cores
% 0.16/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/0.52 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.52 % Search class: FHHNM-FSLM31-MFFFFFNN
% 0.16/0.52 % partial match(1): FHHNM-SSLM31-MFFFFFNN
% 0.16/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.52 % Preprocessing time : 0.003 s
% 0.16/0.52
% 0.16/0.52 % Proof found!
% 0.16/0.52 % SZS status Theorem
% 0.16/0.52 % SZS output start CNFRefutation
% See solution above
% 0.16/0.52 % Parsed axioms : 1132
% 0.16/0.52 % Removed by relevancy pruning/SinE : 834
% 0.16/0.52 % Initial clauses : 299
% 0.16/0.52 % Removed in clause preprocessing : 0
% 0.16/0.52 % Initial clauses in saturation : 299
% 0.16/0.52 % Processed clauses : 1925
% 0.16/0.52 % ...of these trivial : 8
% 0.16/0.52 % ...subsumed : 510
% 0.16/0.52 % ...remaining for further processing : 1407
% 0.16/0.52 % Other redundant clauses eliminated : 0
% 0.16/0.52 % Clauses deleted for lack of memory : 0
% 0.16/0.52 % Backward-subsumed : 1
% 0.16/0.52 % Backward-rewritten : 10
% 0.16/0.52 % Generated clauses : 3477
% 0.16/0.52 % ...of the previous two non-redundant : 2470
% 0.16/0.52 % ...aggressively subsumed : 0
% 0.16/0.52 % Contextual simplify-reflections : 0
% 0.16/0.52 % Paramodulations : 3477
% 0.16/0.52 % Factorizations : 0
% 0.16/0.52 % NegExts : 0
% 0.16/0.52 % Equation resolutions : 0
% 0.16/0.52 % Disequality decompositions : 0
% 0.16/0.52 % Total rewrite steps : 894
% 0.16/0.52 % ...of those cached : 621
% 0.16/0.52 % Propositional unsat checks : 0
% 0.16/0.52 % Propositional check models : 0
% 0.16/0.52 % Propositional check unsatisfiable : 0
% 0.16/0.52 % Propositional clauses : 0
% 0.16/0.52 % Propositional clauses after purity: 0
% 0.16/0.52 % Propositional unsat core size : 0
% 0.16/0.52 % Propositional preprocessing time : 0.000
% 0.16/0.52 % Propositional encoding time : 0.000
% 0.16/0.52 % Propositional solver time : 0.000
% 0.16/0.52 % Success case prop preproc time : 0.000
% 0.16/0.52 % Success case prop encoding time : 0.000
% 0.16/0.52 % Success case prop solver time : 0.000
% 0.16/0.52 % Current number of processed clauses : 1396
% 0.16/0.52 % Positive orientable unit clauses : 557
% 0.16/0.52 % Positive unorientable unit clauses: 0
% 0.16/0.52 % Negative unit clauses : 203
% 0.16/0.52 % Non-unit-clauses : 636
% 0.16/0.52 % Current number of unprocessed clauses: 844
% 0.16/0.52 % ...number of literals in the above : 2330
% 0.16/0.52 % Current number of archived formulas : 0
% 0.16/0.52 % Current number of archived clauses : 11
% 0.16/0.52 % Clause-clause subsumption calls (NU) : 52806
% 0.16/0.52 % Rec. Clause-clause subsumption calls : 51642
% 0.16/0.52 % Non-unit clause-clause subsumptions : 181
% 0.16/0.52 % Unit Clause-clause subsumption calls : 16602
% 0.16/0.52 % Rewrite failures with RHS unbound : 0
% 0.16/0.52 % BW rewrite match attempts : 6
% 0.16/0.52 % BW rewrite match successes : 6
% 0.16/0.52 % Condensation attempts : 0
% 0.16/0.52 % Condensation successes : 0
% 0.16/0.52 % Termbank termtop insertions : 45134
% 0.16/0.52 % Search garbage collected termcells : 5217
% 0.16/0.52
% 0.16/0.52 % -------------------------------------------------
% 0.16/0.52 % User time : 0.059 s
% 0.16/0.52 % System time : 0.012 s
% 0.16/0.52 % Total time : 0.071 s
% 0.16/0.52 % Maximum resident set size: 6400 pages
% 0.16/0.52
% 0.16/0.52 % -------------------------------------------------
% 0.16/0.52 % User time : 0.077 s
% 0.16/0.52 % System time : 0.017 s
% 0.16/0.52 % Total time : 0.094 s
% 0.16/0.52 % Maximum resident set size: 5632 pages
% 0.16/0.52 % E exiting
%------------------------------------------------------------------------------