↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : NLP145-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 : n012.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:37:45 PM UTC 2026

% Result   : Unsatisfiable 0.07s 0.34s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   65 (  10 unt;   0 nHn;  57 RR)
%            Number of literals    :  120 (   4 equ;  63 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   16 (  14 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :  113 (  19 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause89,negated_conjecture,
    ( ~ member(skc7,X1,skc8)
    | frontseat(skc7,skf5(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause89) ).

cnf(clause60,axiom,
    ( ~ two(X1,X2)
    | member(X1,skf10(X2,X1),X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause60) ).

cnf(clause48,axiom,
    ( ~ frontseat(X1,X2)
    | seat(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause48) ).

cnf(clause74,negated_conjecture,
    two(skc7,skc8),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause74) ).

cnf(clause58,axiom,
    ( ~ animate(X1,X2)
    | ~ nonliving(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause58) ).

cnf(clause13,axiom,
    ( ~ human_person(X1,X2)
    | animate(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause13) ).

cnf(clause2,axiom,
    ( ~ fellow(X1,X2)
    | man(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).

cnf(clause88,negated_conjecture,
    ( ~ member(skc7,X1,skc8)
    | fellow(skc7,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause88) ).

cnf(clause49,axiom,
    ( ~ seat(X1,X2)
    | furniture(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause49) ).

cnf(clause33,axiom,
    ( ~ object(X1,X2)
    | nonliving(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause33) ).

cnf(clause3,axiom,
    ( ~ man(X1,X2)
    | human_person(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).

cnf(clause31,axiom,
    ( ~ artifact(X1,X2)
    | object(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause31) ).

cnf(clause30,axiom,
    ( ~ instrumentality(X1,X2)
    | artifact(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause30) ).

cnf(clause50,axiom,
    ( ~ furniture(X1,X2)
    | instrumentality(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause50) ).

cnf(clause59,axiom,
    ( ~ be(X1,X2,X3,X4)
    | X3 = X4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause59) ).

cnf(clause92,negated_conjecture,
    ( ~ member(skc7,X1,skc8)
    | be(skc7,skf6(X1),X1,skf5(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause92) ).

cnf(clause61,axiom,
    ( ~ two(X1,X2)
    | member(X1,skf8(X2,X1),X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause61) ).

cnf(c_0_17,negated_conjecture,
    ( ~ member(skc7,X1,skc8)
    | frontseat(skc7,skf5(X2)) ),
    inference(fof_simplification,[status(thm)],[clause89]) ).

cnf(c_0_18,plain,
    ( ~ two(X1,X2)
    | member(X1,skf10(X2,X1),X2) ),
    inference(fof_simplification,[status(thm)],[clause60]) ).

cnf(c_0_19,plain,
    ( ~ frontseat(X1,X2)
    | seat(X1,X2) ),
    inference(fof_simplification,[status(thm)],[clause48]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ member(skc7,X1,skc8)
    | frontseat(skc7,skf5(X2)) ),
    c_0_17 ).

cnf(c_0_21,plain,
    ( ~ two(X1,X2)
    | member(X1,skf10(X2,X1),X2) ),
    c_0_18 ).

cnf(c_0_22,negated_conjecture,
    two(skc7,skc8),
    clause74 ).

cnf(c_0_23,plain,
    ( ~ animate(X1,X2)
    | ~ nonliving(X1,X2) ),
    inference(fof_simplification,[status(thm)],[clause58]) ).

cnf(c_0_24,plain,
    ( ~ human_person(X1,X2)
    | animate(X1,X2) ),
    inference(fof_simplification,[status(thm)],[clause13]) ).

cnf(c_0_25,plain,
    ( ~ fellow(X1,X2)
    | man(X1,X2) ),
    inference(fof_simplification,[status(thm)],[clause2]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ member(skc7,X1,skc8)
    | fellow(skc7,X1) ),
    inference(fof_simplification,[status(thm)],[clause88]) ).

cnf(c_0_27,plain,
    ( ~ seat(X1,X2)
    | furniture(X1,X2) ),
    inference(fof_simplification,[status(thm)],[clause49]) ).

cnf(c_0_28,plain,
    ( ~ frontseat(X1,X2)
    | seat(X1,X2) ),
    c_0_19 ).

cnf(c_0_29,negated_conjecture,
    frontseat(skc7,skf5(X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).

cnf(c_0_30,plain,
    ( ~ animate(X1,X2)
    | ~ nonliving(X1,X2) ),
    c_0_23 ).

cnf(c_0_31,plain,
    ( ~ human_person(X1,X2)
    | animate(X1,X2) ),
    c_0_24 ).

cnf(c_0_32,plain,
    ( ~ object(X1,X2)
    | nonliving(X1,X2) ),
    inference(fof_simplification,[status(thm)],[clause33]) ).

cnf(c_0_33,plain,
    ( ~ man(X1,X2)
    | human_person(X1,X2) ),
    inference(fof_simplification,[status(thm)],[clause3]) ).

cnf(c_0_34,plain,
    ( ~ fellow(X1,X2)
    | man(X1,X2) ),
    c_0_25 ).

cnf(c_0_35,negated_conjecture,
    ( ~ member(skc7,X1,skc8)
    | fellow(skc7,X1) ),
    c_0_26 ).

cnf(c_0_36,plain,
    ( ~ artifact(X1,X2)
    | object(X1,X2) ),
    inference(fof_simplification,[status(thm)],[clause31]) ).

cnf(c_0_37,plain,
    ( ~ instrumentality(X1,X2)
    | artifact(X1,X2) ),
    inference(fof_simplification,[status(thm)],[clause30]) ).

cnf(c_0_38,plain,
    ( ~ furniture(X1,X2)
    | instrumentality(X1,X2) ),
    inference(fof_simplification,[status(thm)],[clause50]) ).

cnf(c_0_39,plain,
    ( ~ seat(X1,X2)
    | furniture(X1,X2) ),
    c_0_27 ).

cnf(c_0_40,negated_conjecture,
    seat(skc7,skf5(X1)),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_41,plain,
    ( ~ human_person(X1,X2)
    | ~ nonliving(X1,X2) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_42,plain,
    ( ~ object(X1,X2)
    | nonliving(X1,X2) ),
    c_0_32 ).

cnf(c_0_43,plain,
    ( ~ man(X1,X2)
    | human_person(X1,X2) ),
    c_0_33 ).

cnf(c_0_44,negated_conjecture,
    ( ~ member(skc7,X1,skc8)
    | man(skc7,X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_45,plain,
    ( ~ artifact(X1,X2)
    | object(X1,X2) ),
    c_0_36 ).

cnf(c_0_46,plain,
    ( ~ instrumentality(X1,X2)
    | artifact(X1,X2) ),
    c_0_37 ).

cnf(c_0_47,plain,
    ( ~ furniture(X1,X2)
    | instrumentality(X1,X2) ),
    c_0_38 ).

cnf(c_0_48,negated_conjecture,
    furniture(skc7,skf5(X1)),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_49,plain,
    ( ~ human_person(X1,X2)
    | ~ object(X1,X2) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_50,negated_conjecture,
    ( ~ member(skc7,X1,skc8)
    | human_person(skc7,X1) ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_51,plain,
    ( ~ instrumentality(X1,X2)
    | object(X1,X2) ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_52,negated_conjecture,
    instrumentality(skc7,skf5(X1)),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_53,plain,
    ( ~ be(X1,X2,X3,X4)
    | X3 = X4 ),
    inference(fof_simplification,[status(thm)],[clause59]) ).

cnf(c_0_54,negated_conjecture,
    ( ~ member(skc7,X1,skc8)
    | be(skc7,skf6(X1),X1,skf5(X1)) ),
    inference(fof_simplification,[status(thm)],[clause92]) ).

cnf(c_0_55,negated_conjecture,
    ( ~ member(skc7,X1,skc8)
    | ~ object(skc7,X1) ),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_56,negated_conjecture,
    object(skc7,skf5(X1)),
    inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_57,plain,
    ( ~ be(X1,X2,X3,X4)
    | X3 = X4 ),
    c_0_53 ).

cnf(c_0_58,negated_conjecture,
    ( ~ member(skc7,X1,skc8)
    | be(skc7,skf6(X1),X1,skf5(X1)) ),
    c_0_54 ).

cnf(c_0_59,negated_conjecture,
    ~ member(skc7,skf5(X1),skc8),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_60,negated_conjecture,
    ( ~ member(skc7,X1,skc8)
    | skf5(X1) = X1 ),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_61,plain,
    ( ~ two(X1,X2)
    | member(X1,skf8(X2,X1),X2) ),
    inference(fof_simplification,[status(thm)],[clause61]) ).

cnf(c_0_62,negated_conjecture,
    ~ member(skc7,X1,skc8),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_63,plain,
    ( ~ two(X1,X2)
    | member(X1,skf8(X2,X1),X2) ),
    c_0_61 ).

cnf(c_0_64,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_22])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : NLP145-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.30  % Computer : n012.cluster.edu
% 0.04/0.30  % Model    : x86_64 x86_64
% 0.04/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30  % Memory   : 8046.5625MB
% 0.04/0.30  % OS       : Linux 6.8.0-71-generic
% 0.04/0.30  % CPULimit : 300
% 0.04/0.30  % WCLimit  : 300
% 0.04/0.30  % DateTime : Mon Sep 21 01:43:21 UTC 2026
% 0.04/0.30  % CPUTime  : 
% 0.04/0.30  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.32  Running first-order theorem proving
% 0.07/0.32  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.07/0.34  % Version: 3.5.1
% 0.07/0.34  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.34  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.34  % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34  % Starting new_bool_1 with 300s (1) cores
% 0.07/0.34  % Starting sh5l with 300s (1) cores
% 0.07/0.34  % sh5l with pid 1332857 completed with status 0
% 0.07/0.34  % Result found by sh5l
% 0.07/0.34  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.34  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.34  % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34  % Starting new_bool_1 with 300s (1) cores
% 0.07/0.34  % Starting sh5l with 300s (1) cores
% 0.07/0.34  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.34  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.34  % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.07/0.34  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34  % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.34  % SubtermCWHack with pid 1332865 completed with status 0
% 0.07/0.34  % Result found by SubtermCWHack
% 0.07/0.34  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.34  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.34  % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34  % Starting new_bool_1 with 300s (1) cores
% 0.07/0.34  % Starting sh5l with 300s (1) cores
% 0.07/0.34  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.34  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.34  % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.07/0.34  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34  % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.34  % Preprocessing time       : 0.001 s
% 0.07/0.34  
% 0.07/0.34  % Proof found!
% 0.07/0.34  % SZS status Unsatisfiable
% 0.07/0.34  % SZS output start CNFRefutation
% See solution above
% 0.07/0.34  % Parsed axioms                        : 92
% 0.07/0.34  % Removed by relevancy pruning/SinE    : 0
% 0.07/0.34  % Initial clauses                      : 92
% 0.07/0.34  % Removed in clause preprocessing      : 0
% 0.07/0.34  % Initial clauses in saturation        : 92
% 0.07/0.34  % Processed clauses                    : 182
% 0.07/0.34  % ...of these trivial                  : 0
% 0.07/0.34  % ...subsumed                          : 9
% 0.07/0.34  % ...remaining for further processing  : 173
% 0.07/0.34  % Other redundant clauses eliminated   : 0
% 0.07/0.34  % Clauses deleted for lack of memory   : 0
% 0.07/0.34  % Backward-subsumed                    : 21
% 0.07/0.34  % Backward-rewritten                   : 3
% 0.07/0.34  % Generated clauses                    : 109
% 0.07/0.34  % ...of the previous two non-redundant : 104
% 0.07/0.34  % ...aggressively subsumed             : 0
% 0.07/0.34  % Contextual simplify-reflections      : 0
% 0.07/0.34  % Paramodulations                      : 109
% 0.07/0.34  % Factorizations                       : 0
% 0.07/0.34  % NegExts                              : 0
% 0.07/0.34  % Equation resolutions                 : 0
% 0.07/0.34  % Disequality decompositions           : 0
% 0.07/0.34  % Total rewrite steps                  : 11
% 0.07/0.34  % ...of those cached                   : 4
% 0.07/0.34  % Propositional unsat checks           : 0
% 0.07/0.34  %    Propositional check models        : 0
% 0.07/0.34  %    Propositional check unsatisfiable : 0
% 0.07/0.34  %    Propositional clauses             : 0
% 0.07/0.34  %    Propositional clauses after purity: 0
% 0.07/0.34  %    Propositional unsat core size     : 0
% 0.07/0.34  %    Propositional preprocessing time  : 0.000
% 0.07/0.34  %    Propositional encoding time       : 0.000
% 0.07/0.34  %    Propositional solver time         : 0.000
% 0.07/0.34  %    Success case prop preproc time    : 0.000
% 0.07/0.34  %    Success case prop encoding time   : 0.000
% 0.07/0.34  %    Success case prop solver time     : 0.000
% 0.07/0.34  % Current number of processed clauses  : 149
% 0.07/0.34  %    Positive orientable unit clauses  : 38
% 0.07/0.34  %    Positive unorientable unit clauses: 0
% 0.07/0.34  %    Negative unit clauses             : 18
% 0.07/0.34  %    Non-unit-clauses                  : 93
% 0.07/0.34  % Current number of unprocessed clauses: 13
% 0.07/0.34  % ...number of literals in the above   : 39
% 0.07/0.34  % Current number of archived formulas  : 0
% 0.07/0.34  % Current number of archived clauses   : 24
% 0.07/0.34  % Clause-clause subsumption calls (NU) : 2908
% 0.07/0.34  % Rec. Clause-clause subsumption calls : 2848
% 0.07/0.34  % Non-unit clause-clause subsumptions  : 3
% 0.07/0.34  % Unit Clause-clause subsumption calls : 153
% 0.07/0.34  % Rewrite failures with RHS unbound    : 0
% 0.07/0.34  % BW rewrite match attempts            : 3
% 0.07/0.34  % BW rewrite match successes           : 3
% 0.07/0.34  % Condensation attempts                : 0
% 0.07/0.34  % Condensation successes               : 0
% 0.07/0.34  % Termbank termtop insertions          : 3161
% 0.07/0.34  % Search garbage collected termcells   : 173
% 0.07/0.34  
% 0.07/0.34  % -------------------------------------------------
% 0.07/0.34  % User time                : 0.005 s
% 0.07/0.34  % System time              : 0.002 s
% 0.07/0.34  % Total time               : 0.007 s
% 0.07/0.34  % Maximum resident set size: 3960 pages
% 0.07/0.34  
% 0.07/0.34  % -------------------------------------------------
% 0.07/0.34  % User time                : 0.007 s
% 0.07/0.34  % System time              : 0.003 s
% 0.07/0.34  % Total time               : 0.011 s
% 0.07/0.34  % Maximum resident set size: 4608 pages
% 0.07/0.34  % E exiting
%------------------------------------------------------------------------------