↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : MSC003-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n002.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:28:26 PM UTC 2026

% Result   : Unsatisfiable 0.27s 0.55s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   25 (   7 unt;   4 nHn;  21 RR)
%            Number of literals    :   50 (   0 equ;  24 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-5 aty)
%            Number of variables   :   46 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(arms_have_one_hand,hypothesis,
    ( ~ in(X1,arm)
    | has_parts(X1,n1,hand) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',arms_have_one_hand) ).

cnf(not_part_inheritance,axiom,
    ( ~ has_parts(X1,X4,X2)
    | has_parts(X1,times(X4,X5),X3)
    | in(object_in(X1,X2,X3,X4,X5),X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_part_inheritance) ).

cnf(humans_have_two_arms,hypothesis,
    ( ~ in(X1,human)
    | has_parts(X1,n2,arm) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',humans_have_two_arms) ).

cnf(in_boy_in_human,hypothesis,
    ( ~ in(X1,boy)
    | in(X1,human) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_boy_in_human) ).

cnf(part_inheritance,axiom,
    ( ~ has_parts(object_in(X1,X5,X4,X2,X3),X3,X4)
    | ~ has_parts(X1,X2,X5)
    | has_parts(X1,times(X2,X3),X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',part_inheritance) ).

cnf(prove_john_has_2_hands,negated_conjecture,
    ~ has_parts(john,times(n2,n1),hand),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_john_has_2_hands) ).

cnf(john_is_a_boy,hypothesis,
    in(john,boy),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',john_is_a_boy) ).

cnf(c_0_7,hypothesis,
    ( ~ in(X1,arm)
    | has_parts(X1,n1,hand) ),
    inference(fof_simplification,[status(thm)],[arms_have_one_hand]) ).

cnf(c_0_8,plain,
    ( ~ has_parts(X1,X4,X2)
    | has_parts(X1,times(X4,X5),X3)
    | in(object_in(X1,X2,X3,X4,X5),X2) ),
    inference(fof_simplification,[status(thm)],[not_part_inheritance]) ).

cnf(c_0_9,hypothesis,
    ( ~ in(X1,human)
    | has_parts(X1,n2,arm) ),
    inference(fof_simplification,[status(thm)],[humans_have_two_arms]) ).

cnf(c_0_10,hypothesis,
    ( ~ in(X1,boy)
    | in(X1,human) ),
    inference(fof_simplification,[status(thm)],[in_boy_in_human]) ).

cnf(c_0_11,plain,
    ( ~ has_parts(object_in(X1,X5,X4,X2,X3),X3,X4)
    | ~ has_parts(X1,X2,X5)
    | has_parts(X1,times(X2,X3),X4) ),
    inference(fof_simplification,[status(thm)],[part_inheritance]) ).

cnf(c_0_12,hypothesis,
    ( ~ in(X1,arm)
    | has_parts(X1,n1,hand) ),
    c_0_7 ).

cnf(c_0_13,plain,
    ( ~ has_parts(X1,X4,X2)
    | has_parts(X1,times(X4,X5),X3)
    | in(object_in(X1,X2,X3,X4,X5),X2) ),
    c_0_8 ).

cnf(c_0_14,hypothesis,
    ( ~ in(X1,human)
    | has_parts(X1,n2,arm) ),
    c_0_9 ).

cnf(c_0_15,hypothesis,
    ( ~ in(X1,boy)
    | in(X1,human) ),
    c_0_10 ).

cnf(c_0_16,negated_conjecture,
    ~ has_parts(john,times(n2,n1),hand),
    inference(fof_simplification,[status(thm)],[prove_john_has_2_hands]) ).

cnf(c_0_17,plain,
    ( ~ has_parts(object_in(X1,X5,X4,X2,X3),X3,X4)
    | ~ has_parts(X1,X2,X5)
    | has_parts(X1,times(X2,X3),X4) ),
    c_0_11 ).

cnf(c_0_18,hypothesis,
    ( ~ has_parts(X1,X3,arm)
    | has_parts(X1,times(X3,X4),X2)
    | has_parts(object_in(X1,arm,X2,X3,X4),n1,hand) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,hypothesis,
    ( ~ in(X1,boy)
    | has_parts(X1,n2,arm) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,hypothesis,
    in(john,boy),
    john_is_a_boy ).

cnf(c_0_21,negated_conjecture,
    ~ has_parts(john,times(n2,n1),hand),
    c_0_16 ).

cnf(c_0_22,hypothesis,
    ( ~ has_parts(X1,X2,arm)
    | has_parts(X1,times(X2,n1),hand) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,hypothesis,
    has_parts(john,n2,arm),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

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  : MSC003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45  % Computer : n002.cluster.edu
% 0.20/0.45  % Model    : x86_64 x86_64
% 0.20/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45  % Memory   : 8046.5625MB
% 0.20/0.45  % OS       : Linux 6.8.0-71-generic
% 0.20/0.45  % CPULimit : 300
% 0.20/0.45  % WCLimit  : 300
% 0.20/0.45  % DateTime : Mon Sep 21 01:29:47 UTC 2026
% 0.20/0.45  % CPUTime  : 
% 0.20/0.45  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.50  Running first-order theorem proving
% 0.20/0.50  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.27/0.55  % Version: 3.5.1
% 0.27/0.55  % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.27/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.55  % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.27/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.55  % Starting sh5l with 300s (1) cores
% 0.27/0.55  % sh5l with pid 2161326 completed with status 0
% 0.27/0.55  % Result found by sh5l
% 0.27/0.55  % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.27/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.55  % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.27/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.55  % Starting sh5l with 300s (1) cores
% 0.27/0.55  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.27/0.55  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.27/0.55  % Search class: FGUNF-FFSF33-SFFFFFNN
% 0.27/0.55  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.55  % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.55  % SubtermCWHack with pid 2161328 completed with status 0
% 0.27/0.55  % Result found by SubtermCWHack
% 0.27/0.55  % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.27/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.55  % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.27/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.55  % Starting sh5l with 300s (1) cores
% 0.27/0.55  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.27/0.55  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.27/0.55  % Search class: FGUNF-FFSF33-SFFFFFNN
% 0.27/0.55  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.55  % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.55  % Preprocessing time       : 0.002 s
% 0.27/0.55  
% 0.27/0.55  % Proof found!
% 0.27/0.55  % SZS status Unsatisfiable
% 0.27/0.55  % SZS output start CNFRefutation
% See solution above
% 0.27/0.55  % Parsed axioms                        : 8
% 0.27/0.55  % Removed by relevancy pruning/SinE    : 0
% 0.27/0.55  % Initial clauses                      : 8
% 0.27/0.55  % Removed in clause preprocessing      : 0
% 0.27/0.55  % Initial clauses in saturation        : 8
% 0.27/0.55  % Processed clauses                    : 12
% 0.27/0.55  % ...of these trivial                  : 0
% 0.27/0.55  % ...subsumed                          : 0
% 0.27/0.55  % ...remaining for further processing  : 12
% 0.27/0.55  % Other redundant clauses eliminated   : 0
% 0.27/0.55  % Clauses deleted for lack of memory   : 0
% 0.27/0.55  % Backward-subsumed                    : 0
% 0.27/0.55  % Backward-rewritten                   : 0
% 0.27/0.55  % Generated clauses                    : 9
% 0.27/0.55  % ...of the previous two non-redundant : 7
% 0.27/0.55  % ...aggressively subsumed             : 0
% 0.27/0.55  % Contextual simplify-reflections      : 0
% 0.27/0.55  % Paramodulations                      : 9
% 0.27/0.55  % Factorizations                       : 0
% 0.27/0.55  % NegExts                              : 0
% 0.27/0.55  % Equation resolutions                 : 0
% 0.27/0.55  % Disequality decompositions           : 0
% 0.27/0.55  % Total rewrite steps                  : 1
% 0.27/0.55  % ...of those cached                   : 0
% 0.27/0.55  % Propositional unsat checks           : 0
% 0.27/0.55  %    Propositional check models        : 0
% 0.27/0.55  %    Propositional check unsatisfiable : 0
% 0.27/0.55  %    Propositional clauses             : 0
% 0.27/0.55  %    Propositional clauses after purity: 0
% 0.27/0.55  %    Propositional unsat core size     : 0
% 0.27/0.55  %    Propositional preprocessing time  : 0.000
% 0.27/0.55  %    Propositional encoding time       : 0.000
% 0.27/0.55  %    Propositional solver time         : 0.000
% 0.27/0.55  %    Success case prop preproc time    : 0.000
% 0.27/0.55  %    Success case prop encoding time   : 0.000
% 0.27/0.55  %    Success case prop solver time     : 0.000
% 0.27/0.55  % Current number of processed clauses  : 12
% 0.27/0.55  %    Positive orientable unit clauses  : 2
% 0.27/0.55  %    Positive unorientable unit clauses: 0
% 0.27/0.55  %    Negative unit clauses             : 1
% 0.27/0.55  %    Non-unit-clauses                  : 9
% 0.27/0.55  % Current number of unprocessed clauses: 3
% 0.27/0.55  % ...number of literals in the above   : 9
% 0.27/0.55  % Current number of archived formulas  : 0
% 0.27/0.55  % Current number of archived clauses   : 0
% 0.27/0.55  % Clause-clause subsumption calls (NU) : 5
% 0.27/0.55  % Rec. Clause-clause subsumption calls : 5
% 0.27/0.55  % Non-unit clause-clause subsumptions  : 0
% 0.27/0.55  % Unit Clause-clause subsumption calls : 0
% 0.27/0.55  % Rewrite failures with RHS unbound    : 0
% 0.27/0.55  % BW rewrite match attempts            : 0
% 0.27/0.55  % BW rewrite match successes           : 0
% 0.27/0.55  % Condensation attempts                : 0
% 0.27/0.55  % Condensation successes               : 0
% 0.27/0.55  % Termbank termtop insertions          : 373
% 0.27/0.55  % Search garbage collected termcells   : 22
% 0.27/0.55  
% 0.27/0.55  % -------------------------------------------------
% 0.27/0.55  % User time                : 0.004 s
% 0.27/0.55  % System time              : 0.003 s
% 0.27/0.55  % Total time               : 0.007 s
% 0.27/0.55  % Maximum resident set size: 3636 pages
% 0.27/0.55  
% 0.27/0.55  % -------------------------------------------------
% 0.27/0.55  % User time                : 0.004 s
% 0.27/0.55  % System time              : 0.011 s
% 0.27/0.55  % Total time               : 0.015 s
% 0.27/0.55  % Maximum resident set size: 4864 pages
% 0.27/0.55  % E exiting
%------------------------------------------------------------------------------