↑ Up

E---3.5.1.SAT-Sat.s

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

% Computer : n003.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:38 PM UTC 2026

% Result   : Satisfiable 0.14s 0.43s
% Output   : Saturation 0.14s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_44ERROR: Could not build tree for root c_0_79ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_31,negated_conjecture,
    ( ~ female(X2)
    | ~ sex(X1,X2)
    | ~ parent(X1)
    | mother(X1) ),
    c_0_27,
    [final] ).

cnf(c_0_32,negated_conjecture,
    ( ~ person(X1)
    | sex(X1,sex_of1(X1)) ),
    c_0_28,
    [final] ).

cnf(c_0_33,negated_conjecture,
    ( ~ parent(X1)
    | person(X1) ),
    c_0_29,
    [final] ).

cnf(c_0_34,negated_conjecture,
    ( ~ male(X2)
    | ~ sex(X1,X2)
    | child_with_parent(X1) ),
    c_0_30,
    [final] ).

cnf(c_0_35,negated_conjecture,
    ( ~ female(sex_of1(X1))
    | ~ parent(X1)
    | mother(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
    [final] ).

cnf(c_0_36,negated_conjecture,
    ( female(X1)
    | male(X1) ),
    female2,
    [final] ).

cnf(c_0_45,negated_conjecture,
    ( ~ male(sex_of1(X1))
    | ~ person(X1)
    | child_with_parent(X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_32]),
    [final] ).

cnf(c_0_46,negated_conjecture,
    ( ~ parent(X1)
    | male(sex_of1(X1))
    | mother(X1) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]),
    [final] ).

cnf(c_0_49,negated_conjecture,
    ( ~ male(X2)
    | ~ sex(X1,X2)
    | person(X1) ),
    c_0_37,
    [final] ).

cnf(c_0_50,negated_conjecture,
    ( ~ child_with_parent(X1)
    | sex(X1,sex_of3(X1)) ),
    c_0_38,
    [final] ).

cnf(c_0_51,negated_conjecture,
    ( ~ child_with_parent(X1)
    | male(sex_of3(X1)) ),
    c_0_39,
    [final] ).

cnf(c_0_52,negated_conjecture,
    ( ~ child(X1,X2)
    | ~ parent_with_sons_only(X1)
    | child_with_parent(X2) ),
    c_0_40,
    [final] ).

cnf(c_0_53,negated_conjecture,
    ( ~ grandparent(X1)
    | child(X1,child_of2(X1)) ),
    c_0_41,
    [final] ).

cnf(c_0_54,negated_conjecture,
    ( ~ parent(X1)
    | child(X1,child_of1(X1)) ),
    c_0_42,
    [final] ).

cnf(c_0_55,negated_conjecture,
    ( ~ parent_with_sons_only(X1)
    | parent(X1) ),
    c_0_43,
    [final] ).

cnf(c_0_60,negated_conjecture,
    ( ~ child_with_parent(female_child_of(X1))
    | ~ parent(X1)
    | parent_with_sons_only(X1) ),
    c_0_44,
    [final] ).

cnf(c_0_61,negated_conjecture,
    ( ~ parent(X1)
    | mother(X1)
    | child_with_parent(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_33]),
    [final] ).

cnf(c_0_62,negated_conjecture,
    ( ~ parent(X2)
    | ~ child(X1,X2)
    | ~ parent(X1)
    | grandparent(X1) ),
    c_0_47,
    [final] ).

cnf(c_0_63,negated_conjecture,
    ( ~ parent(X1)
    | parent_with_sons_only(X1)
    | child(X1,female_child_of(X1)) ),
    c_0_48,
    [final] ).

cnf(c_0_65,negated_conjecture,
    ( ~ child_with_parent(X1)
    | person(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),
    [final] ).

cnf(c_0_66,negated_conjecture,
    ( ~ grandparent(X1)
    | ~ parent_with_sons_only(X1)
    | child_with_parent(child_of2(X1)) ),
    inference(spm,[status(thm)],[c_0_52,c_0_53]),
    [final] ).

cnf(c_0_67,negated_conjecture,
    ( ~ parent_with_sons_only(X1)
    | child_with_parent(child_of1(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_54]),c_0_55]),
    [final] ).

cnf(c_0_68,negated_conjecture,
    ( ~ female(X2)
    | ~ sex(X1,X2)
    | person(X1) ),
    c_0_56,
    [final] ).

cnf(c_0_69,negated_conjecture,
    ( ~ mother(X1)
    | sex(X1,sex_of2(X1)) ),
    c_0_57,
    [final] ).

cnf(c_0_70,negated_conjecture,
    ( ~ mother(X1)
    | female(sex_of2(X1)) ),
    c_0_58,
    [final] ).

cnf(c_0_71,negated_conjecture,
    ( ~ male(X1)
    | ~ female(X1) ),
    c_0_59,
    [final] ).

cnf(c_0_79,negated_conjecture,
    ( ~ parent(X1)
    | ~ parent(female_child_of(X1))
    | mother(female_child_of(X1))
    | parent_with_sons_only(X1) ),
    inference(spm,[status(thm)],[c_0_60,c_0_61]),
    [final] ).

cnf(c_0_80,negated_conjecture,
    ( ~ parent(X1)
    | ~ parent(female_child_of(X1))
    | grandparent(X1)
    | parent_with_sons_only(X1) ),
    inference(spm,[status(thm)],[c_0_62,c_0_63]),
    [final] ).

cnf(c_0_81,negated_conjecture,
    ( ~ female(sex_of3(X1))
    | ~ parent(X1)
    | ~ child_with_parent(X1)
    | mother(X1) ),
    inference(spm,[status(thm)],[c_0_31,c_0_50]),
    [final] ).

cnf(c_0_82,negated_conjecture,
    ( ~ parent(X1)
    | ~ parent(child_of1(X1))
    | grandparent(X1) ),
    inference(spm,[status(thm)],[c_0_62,c_0_54]),
    [final] ).

cnf(c_0_83,negated_conjecture,
    ( ~ person(X2)
    | ~ child(X1,X2)
    | ~ person(X1)
    | parent(X1) ),
    c_0_64,
    [final] ).

cnf(c_0_84,negated_conjecture,
    ( ~ grandparent(X1)
    | ~ parent_with_sons_only(X1)
    | person(child_of2(X1)) ),
    inference(spm,[status(thm)],[c_0_65,c_0_66]),
    [final] ).

cnf(c_0_85,negated_conjecture,
    ( ~ parent_with_sons_only(X1)
    | person(child_of1(X1)) ),
    inference(spm,[status(thm)],[c_0_65,c_0_67]),
    [final] ).

cnf(c_0_86,negated_conjecture,
    ( ~ mother(X1)
    | person(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),
    [final] ).

cnf(c_0_87,negated_conjecture,
    ( ~ male(sex_of2(X1))
    | ~ mother(X1) ),
    inference(spm,[status(thm)],[c_0_71,c_0_70]),
    [final] ).

cnf(c_0_88,negated_conjecture,
    ( ~ grandparent(X1)
    | parent(child_of2(X1)) ),
    c_0_72,
    [final] ).

cnf(c_0_89,negated_conjecture,
    ( ~ parent(X1)
    | person(child_of1(X1)) ),
    c_0_73,
    [final] ).

cnf(c_0_90,negated_conjecture,
    ( ~ parent(X1)
    | father(X1)
    | mother(X1) ),
    c_0_74,
    [final] ).

cnf(c_0_91,negated_conjecture,
    ( ~ mother(X1)
    | ~ father(X1) ),
    c_0_75,
    [final] ).

cnf(c_0_92,negated_conjecture,
    ( ~ grandparent(X1)
    | parent(X1) ),
    c_0_76,
    [final] ).

cnf(c_0_93,negated_conjecture,
    ( ~ father(X1)
    | parent(X1) ),
    c_0_77,
    [final] ).

cnf(c_0_94,negated_conjecture,
    ( ~ mother(X1)
    | parent(X1) ),
    c_0_78,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MSC009-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37  % Computer : n003.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 21 01:29:00 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  Running first-order theorem proving
% 0.14/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.14/0.43  % Version: 3.5.1
% 0.14/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43  % Starting sh5l with 300s (1) cores
% 0.14/0.43  % new_bool_1 with pid 3105739 completed with status 1
% 0.14/0.43  % Result found by new_bool_1
% 0.14/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43  % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.14/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43  % SubtermCWHack with pid 3105741 completed with status 1
% 0.14/0.43  % Result found by SubtermCWHack
% 0.14/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43  % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.14/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43  % Preprocessing time       : 0.001 s
% 0.14/0.43  
% 0.14/0.43  % No proof found!
% 0.14/0.43  % SZS status Satisfiable
% 0.14/0.43  % SZS output start Saturation
% See solution above
% 0.14/0.43  % Parsed axioms                        : 28
% 0.14/0.43  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.43  % Initial clauses                      : 28
% 0.14/0.43  % Removed in clause preprocessing      : 0
% 0.14/0.43  % Initial clauses in saturation        : 28
% 0.14/0.43  % Processed clauses                    : 50
% 0.14/0.43  % ...of these trivial                  : 0
% 0.14/0.43  % ...subsumed                          : 7
% 0.14/0.43  % ...remaining for further processing  : 43
% 0.14/0.43  % Other redundant clauses eliminated   : 0
% 0.14/0.43  % Clauses deleted for lack of memory   : 0
% 0.14/0.43  % Backward-subsumed                    : 1
% 0.14/0.43  % Backward-rewritten                   : 0
% 0.14/0.43  % Generated clauses                    : 35
% 0.14/0.43  % ...of the previous two non-redundant : 23
% 0.14/0.43  % ...aggressively subsumed             : 0
% 0.14/0.43  % Contextual simplify-reflections      : 5
% 0.14/0.43  % Paramodulations                      : 35
% 0.14/0.43  % Factorizations                       : 0
% 0.14/0.43  % NegExts                              : 0
% 0.14/0.43  % Equation resolutions                 : 0
% 0.14/0.43  % Disequality decompositions           : 0
% 0.14/0.43  % Total rewrite steps                  : 0
% 0.14/0.43  % ...of those cached                   : 0
% 0.14/0.43  % Propositional unsat checks           : 0
% 0.14/0.43  %    Propositional check models        : 0
% 0.14/0.43  %    Propositional check unsatisfiable : 0
% 0.14/0.43  %    Propositional clauses             : 0
% 0.14/0.43  %    Propositional clauses after purity: 0
% 0.14/0.43  %    Propositional unsat core size     : 0
% 0.14/0.43  %    Propositional preprocessing time  : 0.000
% 0.14/0.43  %    Propositional encoding time       : 0.000
% 0.14/0.43  %    Propositional solver time         : 0.000
% 0.14/0.43  %    Success case prop preproc time    : 0.000
% 0.14/0.43  %    Success case prop encoding time   : 0.000
% 0.14/0.43  %    Success case prop solver time     : 0.000
% 0.14/0.43  % Current number of processed clauses  : 42
% 0.14/0.43  %    Positive orientable unit clauses  : 0
% 0.14/0.43  %    Positive unorientable unit clauses: 0
% 0.14/0.43  %    Negative unit clauses             : 0
% 0.14/0.43  %    Non-unit-clauses                  : 42
% 0.14/0.43  % Current number of unprocessed clauses: 0
% 0.14/0.43  % ...number of literals in the above   : 0
% 0.14/0.43  % Current number of archived formulas  : 0
% 0.14/0.43  % Current number of archived clauses   : 1
% 0.14/0.43  % Clause-clause subsumption calls (NU) : 404
% 0.14/0.43  % Rec. Clause-clause subsumption calls : 284
% 0.14/0.43  % Non-unit clause-clause subsumptions  : 13
% 0.14/0.43  % Unit Clause-clause subsumption calls : 0
% 0.14/0.43  % Rewrite failures with RHS unbound    : 0
% 0.14/0.43  % BW rewrite match attempts            : 0
% 0.14/0.43  % BW rewrite match successes           : 0
% 0.14/0.43  % Condensation attempts                : 0
% 0.14/0.43  % Condensation successes               : 0
% 0.14/0.43  % Termbank termtop insertions          : 1382
% 0.14/0.43  % Search garbage collected termcells   : 60
% 0.14/0.43  
% 0.14/0.43  % -------------------------------------------------
% 0.14/0.43  % User time                : 0.003 s
% 0.14/0.43  % System time              : 0.003 s
% 0.14/0.43  % Total time               : 0.006 s
% 0.14/0.43  % Maximum resident set size: 3648 pages
% 0.14/0.43  
% 0.14/0.43  % -------------------------------------------------
% 0.14/0.43  % User time                : 0.005 s
% 0.14/0.43  % System time              : 0.007 s
% 0.14/0.43  % Total time               : 0.012 s
% 0.14/0.43  % Maximum resident set size: 4864 pages
% 0.14/0.43  % E exiting
%------------------------------------------------------------------------------