%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP208-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 : n019.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:37 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 39 ( 11 unt; 0 nHn; 39 RR)
% Number of literals : 67 ( 4 equ; 34 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 62 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause60,axiom,
( ~ unisex(X1,X2)
| ~ male(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause60) ).
cnf(clause34,axiom,
( ~ man(X1,X2)
| male(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause34) ).
cnf(clause67,axiom,
( ~ be(X1,X2,X3,X4)
| X3 = X4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause67) ).
cnf(clause11,axiom,
( ~ device(X1,X2)
| instrumentality(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause11) ).
cnf(clause10,axiom,
( ~ wheel(X1,X2)
| device(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause10) ).
cnf(clause20,axiom,
( ~ object(X1,X2)
| unisex(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause20) ).
cnf(clause106,negated_conjecture,
be(skc11,skc13,skc15,skc12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause106) ).
cnf(clause13,axiom,
( ~ artifact(X1,X2)
| object(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause13) ).
cnf(clause12,axiom,
( ~ instrumentality(X1,X2)
| artifact(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause12) ).
cnf(clause94,negated_conjecture,
man(skc11,skc15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause94) ).
cnf(clause98,negated_conjecture,
wheel(skc11,skc12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause98) ).
cnf(c_0_11,plain,
( ~ unisex(X1,X2)
| ~ male(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_12,plain,
( ~ man(X1,X2)
| male(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause34]) ).
cnf(c_0_13,plain,
( ~ be(X1,X2,X3,X4)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[clause67]) ).
cnf(c_0_14,plain,
( ~ device(X1,X2)
| instrumentality(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause11]) ).
cnf(c_0_15,plain,
( ~ wheel(X1,X2)
| device(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause10]) ).
cnf(c_0_16,plain,
( ~ unisex(X1,X2)
| ~ male(X1,X2) ),
c_0_11 ).
cnf(c_0_17,plain,
( ~ man(X1,X2)
| male(X1,X2) ),
c_0_12 ).
cnf(c_0_18,plain,
( ~ object(X1,X2)
| unisex(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause20]) ).
cnf(c_0_19,plain,
( ~ be(X1,X2,X3,X4)
| X3 = X4 ),
c_0_13 ).
cnf(c_0_20,negated_conjecture,
be(skc11,skc13,skc15,skc12),
clause106 ).
cnf(c_0_21,plain,
( ~ artifact(X1,X2)
| object(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause13]) ).
cnf(c_0_22,plain,
( ~ instrumentality(X1,X2)
| artifact(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause12]) ).
cnf(c_0_23,plain,
( ~ device(X1,X2)
| instrumentality(X1,X2) ),
c_0_14 ).
cnf(c_0_24,plain,
( ~ wheel(X1,X2)
| device(X1,X2) ),
c_0_15 ).
cnf(c_0_25,plain,
( ~ unisex(X1,X2)
| ~ man(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,plain,
( ~ object(X1,X2)
| unisex(X1,X2) ),
c_0_18 ).
cnf(c_0_27,negated_conjecture,
man(skc11,skc15),
clause94 ).
cnf(c_0_28,negated_conjecture,
skc15 = skc12,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
( ~ artifact(X1,X2)
| object(X1,X2) ),
c_0_21 ).
cnf(c_0_30,plain,
( ~ instrumentality(X1,X2)
| artifact(X1,X2) ),
c_0_22 ).
cnf(c_0_31,plain,
( ~ wheel(X1,X2)
| instrumentality(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,negated_conjecture,
wheel(skc11,skc12),
clause98 ).
cnf(c_0_33,plain,
( ~ object(X1,X2)
| ~ man(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,negated_conjecture,
man(skc11,skc12),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( ~ instrumentality(X1,X2)
| object(X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
instrumentality(skc11,skc12),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
~ object(skc11,skc12),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP208-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 : n019.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:49:20 UTC 2026
% 0.11/0.37 % 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: FSLSSMSMSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr 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 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1443400 completed with status 0
% 0.11/0.45 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.11/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr 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 C07_19_nc_SOS_SAT001_MinMin_p005000_rr 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 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1443406 completed with status 0
% 0.11/0.45 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.11/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr 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 C07_19_nc_SOS_SAT001_MinMin_p005000_rr 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 : 120
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 120
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 120
% 0.11/0.45 % Processed clauses : 314
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 3
% 0.11/0.45 % ...remaining for further processing : 311
% 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 : 2
% 0.11/0.45 % Backward-rewritten : 5
% 0.11/0.45 % Generated clauses : 110
% 0.11/0.45 % ...of the previous two non-redundant : 103
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 110
% 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 : 24
% 0.11/0.45 % ...of those cached : 15
% 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 : 184
% 0.11/0.45 % Positive orientable unit clauses : 42
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 12
% 0.11/0.45 % Non-unit-clauses : 130
% 0.11/0.45 % Current number of unprocessed clauses: 27
% 0.11/0.45 % ...number of literals in the above : 91
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 127
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 10658
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 8414
% 0.11/0.45 % Non-unit clause-clause subsumptions : 3
% 0.11/0.45 % Unit Clause-clause subsumption calls : 179
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 3
% 0.11/0.45 % BW rewrite match successes : 3
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 5001
% 0.11/0.45 % Search garbage collected termcells : 229
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.011 s
% 0.11/0.45 % System time : 0.004 s
% 0.11/0.45 % Total time : 0.015 s
% 0.11/0.45 % Maximum resident set size: 3468 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.039 s
% 0.11/0.45 % System time : 0.017 s
% 0.11/0.45 % Total time : 0.056 s
% 0.11/0.45 % Maximum resident set size: 4608 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------