%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP147-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 01:35:17 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of clauses : 59 ( 17 unt; 0 nHn; 49 RR)
% Number of literals : 101 ( 4 equ; 47 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause60,axiom,
( ~ two(X1,X2)
| member(X1,skf10(X2,X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause60) ).
cnf(clause89,negated_conjecture,
( ~ member(skc6,X1,skc7)
| frontseat(skc6,skf5(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause89) ).
cnf(clause77,negated_conjecture,
two(skc6,skc7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause77) ).
cnf(clause48,axiom,
( ~ frontseat(X1,X2)
| seat(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause48) ).
cnf(clause49,axiom,
( ~ seat(X1,X2)
| furniture(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause49) ).
cnf(clause50,axiom,
( ~ furniture(X1,X2)
| instrumentality(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause50) ).
cnf(clause30,axiom,
( ~ instrumentality(X1,X2)
| artifact(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause30) ).
cnf(clause31,axiom,
( ~ artifact(X1,X2)
| object(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause31) ).
cnf(clause35,axiom,
( ~ object(X1,X2)
| unisex(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause35) ).
cnf(clause92,negated_conjecture,
( ~ member(skc6,X1,skc7)
| be(skc6,skf6(X1),X1,skf5(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause92) ).
cnf(clause88,negated_conjecture,
( ~ member(skc6,X1,skc7)
| fellow(skc6,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause88) ).
cnf(clause52,axiom,
( ~ unisex(X1,X2)
| ~ male(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause52) ).
cnf(clause59,axiom,
( ~ be(X1,X2,X3,X4)
| X3 = X4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause59) ).
cnf(clause2,axiom,
( ~ fellow(X1,X2)
| man(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(clause14,axiom,
( ~ man(X1,X2)
| male(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause14) ).
cnf(c_0_15,plain,
( ~ two(X1,X2)
| member(X1,skf10(X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_16,negated_conjecture,
( ~ member(skc6,X1,skc7)
| frontseat(skc6,skf5(X2)) ),
inference(fof_simplification,[status(thm)],[clause89]) ).
cnf(c_0_17,plain,
( ~ two(X1,X2)
| member(X1,skf10(X2,X1),X2) ),
c_0_15 ).
cnf(c_0_18,negated_conjecture,
two(skc6,skc7),
clause77 ).
cnf(c_0_19,plain,
( ~ frontseat(X1,X2)
| seat(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause48]) ).
cnf(c_0_20,negated_conjecture,
( ~ member(skc6,X1,skc7)
| frontseat(skc6,skf5(X2)) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
member(skc6,skf10(skc7,skc6),skc7),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( ~ seat(X1,X2)
| furniture(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause49]) ).
cnf(c_0_23,plain,
( ~ frontseat(X1,X2)
| seat(X1,X2) ),
c_0_19 ).
cnf(c_0_24,negated_conjecture,
frontseat(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ furniture(X1,X2)
| instrumentality(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause50]) ).
cnf(c_0_26,plain,
( ~ seat(X1,X2)
| furniture(X1,X2) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
seat(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( ~ instrumentality(X1,X2)
| artifact(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause30]) ).
cnf(c_0_29,plain,
( ~ furniture(X1,X2)
| instrumentality(X1,X2) ),
c_0_25 ).
cnf(c_0_30,negated_conjecture,
furniture(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( ~ artifact(X1,X2)
| object(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause31]) ).
cnf(c_0_32,plain,
( ~ instrumentality(X1,X2)
| artifact(X1,X2) ),
c_0_28 ).
cnf(c_0_33,negated_conjecture,
instrumentality(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( ~ object(X1,X2)
| unisex(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause35]) ).
cnf(c_0_35,plain,
( ~ artifact(X1,X2)
| object(X1,X2) ),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
artifact(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( ~ member(skc6,X1,skc7)
| be(skc6,skf6(X1),X1,skf5(X1)) ),
inference(fof_simplification,[status(thm)],[clause92]) ).
cnf(c_0_38,negated_conjecture,
( ~ member(skc6,X1,skc7)
| fellow(skc6,X1) ),
inference(fof_simplification,[status(thm)],[clause88]) ).
cnf(c_0_39,plain,
( ~ unisex(X1,X2)
| ~ male(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause52]) ).
cnf(c_0_40,plain,
( ~ object(X1,X2)
| unisex(X1,X2) ),
c_0_34 ).
cnf(c_0_41,negated_conjecture,
object(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
( ~ be(X1,X2,X3,X4)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[clause59]) ).
cnf(c_0_43,negated_conjecture,
( ~ member(skc6,X1,skc7)
| be(skc6,skf6(X1),X1,skf5(X1)) ),
c_0_37 ).
cnf(c_0_44,plain,
( ~ fellow(X1,X2)
| man(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause2]) ).
cnf(c_0_45,negated_conjecture,
( ~ member(skc6,X1,skc7)
| fellow(skc6,X1) ),
c_0_38 ).
cnf(c_0_46,plain,
( ~ unisex(X1,X2)
| ~ male(X1,X2) ),
c_0_39 ).
cnf(c_0_47,negated_conjecture,
unisex(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,plain,
( ~ be(X1,X2,X3,X4)
| X3 = X4 ),
c_0_42 ).
cnf(c_0_49,negated_conjecture,
be(skc6,skf6(skf10(skc7,skc6)),skf10(skc7,skc6),skf5(skf10(skc7,skc6))),
inference(spm,[status(thm)],[c_0_43,c_0_21]) ).
cnf(c_0_50,plain,
( ~ man(X1,X2)
| male(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause14]) ).
cnf(c_0_51,plain,
( ~ fellow(X1,X2)
| man(X1,X2) ),
c_0_44 ).
cnf(c_0_52,negated_conjecture,
fellow(skc6,skf10(skc7,skc6)),
inference(spm,[status(thm)],[c_0_45,c_0_21]) ).
cnf(c_0_53,negated_conjecture,
~ male(skc6,skf5(X1)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
skf5(skf10(skc7,skc6)) = skf10(skc7,skc6),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
( ~ man(X1,X2)
| male(X1,X2) ),
c_0_50 ).
cnf(c_0_56,negated_conjecture,
man(skc6,skf10(skc7,skc6)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
~ male(skc6,skf10(skc7,skc6)),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP147-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 01:43:12 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1749481 completed with status 0
% 0.11/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.11/0.45 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.11/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1749487 completed with status 0
% 0.11/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.11/0.45 % Preprocessing time : 0.001 s
% 0.11/0.45 % Presaturation interreduction done
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Unsatisfiable
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 92
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 92
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 92
% 0.11/0.45 % Processed clauses : 285
% 0.11/0.45 % ...of these trivial : 1
% 0.11/0.45 % ...subsumed : 0
% 0.11/0.45 % ...remaining for further processing : 284
% 0.11/0.45 % Other redundant clauses eliminated : 0
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 0
% 0.11/0.45 % Backward-rewritten : 4
% 0.11/0.45 % Generated clauses : 129
% 0.11/0.45 % ...of the previous two non-redundant : 123
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 129
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 0
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 13
% 0.11/0.45 % ...of those cached : 2
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 188
% 0.11/0.45 % Positive orientable unit clauses : 95
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 23
% 0.11/0.45 % Non-unit-clauses : 70
% 0.11/0.45 % Current number of unprocessed clauses: 19
% 0.11/0.45 % ...number of literals in the above : 19
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 96
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 3313
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 2262
% 0.11/0.45 % Non-unit clause-clause subsumptions : 0
% 0.11/0.45 % Unit Clause-clause subsumption calls : 239
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 4
% 0.11/0.45 % BW rewrite match successes : 4
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 3828
% 0.11/0.45 % Search garbage collected termcells : 173
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.009 s
% 0.11/0.45 % System time : 0.003 s
% 0.11/0.45 % Total time : 0.012 s
% 0.11/0.45 % Maximum resident set size: 3428 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.036 s
% 0.11/0.45 % System time : 0.012 s
% 0.11/0.45 % Total time : 0.047 s
% 0.11/0.45 % Maximum resident set size: 4608 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------