↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n017.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 02:01:21 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c1,axiom,
    ( ~ b_is_a_knight
    | ~ a_is_a_knight ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c1) ).

cnf(c18,negated_conjecture,
    b_is_a_knight,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c18) ).

cnf(c17,axiom,
    ( ~ c_is_a_knight
    | a_is_a_knight ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c17) ).

cnf(c13,axiom,
    ( c_is_a_knight
    | a_is_a_knight
    | d_is_a_knight ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c13) ).

cnf(c6,axiom,
    ( ~ d_is_a_knight
    | ~ c_is_a_knight ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c6) ).

cnf(c10,axiom,
    ( ~ d_is_a_knight
    | ~ e_is_a_knight
    | c_is_a_knight ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c10) ).

cnf(c16,axiom,
    ( e_is_a_knight
    | a_is_a_knight ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c16) ).

cnf(c_0_7,plain,
    ( ~ b_is_a_knight
    | ~ a_is_a_knight ),
    inference(fof_simplification,[status(thm)],[c1]) ).

cnf(c_0_8,plain,
    ( ~ b_is_a_knight
    | ~ a_is_a_knight ),
    c_0_7 ).

cnf(c_0_9,negated_conjecture,
    b_is_a_knight,
    c18 ).

cnf(c_0_10,plain,
    ( ~ c_is_a_knight
    | a_is_a_knight ),
    inference(fof_simplification,[status(thm)],[c17]) ).

cnf(c_0_11,axiom,
    ( c_is_a_knight
    | a_is_a_knight
    | d_is_a_knight ),
    c13 ).

cnf(c_0_12,plain,
    ~ a_is_a_knight,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).

cnf(c_0_13,plain,
    ( ~ d_is_a_knight
    | ~ c_is_a_knight ),
    inference(fof_simplification,[status(thm)],[c6]) ).

cnf(c_0_14,plain,
    ( ~ c_is_a_knight
    | a_is_a_knight ),
    c_0_10 ).

cnf(c_0_15,plain,
    ( d_is_a_knight
    | c_is_a_knight ),
    inference(sr,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    ( ~ d_is_a_knight
    | ~ e_is_a_knight
    | c_is_a_knight ),
    inference(fof_simplification,[status(thm)],[c10]) ).

cnf(c_0_17,axiom,
    ( e_is_a_knight
    | a_is_a_knight ),
    c16 ).

cnf(c_0_18,plain,
    ( ~ d_is_a_knight
    | ~ c_is_a_knight ),
    c_0_13 ).

cnf(c_0_19,plain,
    d_is_a_knight,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_12]) ).

cnf(c_0_20,plain,
    ( ~ d_is_a_knight
    | ~ e_is_a_knight
    | c_is_a_knight ),
    c_0_16 ).

cnf(c_0_21,plain,
    e_is_a_knight,
    inference(sr,[status(thm)],[c_0_17,c_0_12]) ).

cnf(c_0_22,plain,
    ~ c_is_a_knight,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).

cnf(c_0_23,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19]),c_0_21])]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36  % Computer : n017.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 21 03:40:12 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.11/0.42  % Version: 3.5.1
% 0.11/0.42  % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.11/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.11/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.42  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.42  % Starting sh5l with 300s (1) cores
% 0.11/0.42  % sh5l with pid 1347859 completed with status 0
% 0.11/0.42  % Result found by sh5l
% 0.11/0.42  % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.11/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.11/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.42  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.42  % Starting sh5l with 300s (1) cores
% 0.11/0.42  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.42  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.42  % Search class: FGHNF-FFSS00-SFFFFFNN
% 0.11/0.42  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.42  % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.42  % SubtermCWHack with pid 1347866 completed with status 0
% 0.11/0.42  % Result found by SubtermCWHack
% 0.11/0.42  % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.11/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.11/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.42  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.42  % Starting sh5l with 300s (1) cores
% 0.11/0.42  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.42  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.42  % Search class: FGHNF-FFSS00-SFFFFFNN
% 0.11/0.42  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.42  % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.42  % Preprocessing time       : 0.001 s
% 0.11/0.42  
% 0.11/0.42  % Proof found!
% 0.11/0.42  % SZS status Unsatisfiable
% 0.11/0.42  % SZS output start CNFRefutation
% See solution above
% 0.11/0.43  % Parsed axioms                        : 18
% 0.11/0.43  % Removed by relevancy pruning/SinE    : 0
% 0.11/0.43  % Initial clauses                      : 18
% 0.11/0.43  % Removed in clause preprocessing      : 0
% 0.11/0.43  % Initial clauses in saturation        : 18
% 0.11/0.43  % Processed clauses                    : 20
% 0.11/0.43  % ...of these trivial                  : 4
% 0.11/0.43  % ...subsumed                          : 5
% 0.11/0.43  % ...remaining for further processing  : 10
% 0.11/0.43  % Other redundant clauses eliminated   : 0
% 0.11/0.43  % Clauses deleted for lack of memory   : 0
% 0.11/0.43  % Backward-subsumed                    : 3
% 0.11/0.43  % Backward-rewritten                   : 1
% 0.11/0.43  % Generated clauses                    : 2
% 0.11/0.43  % ...of the previous two non-redundant : 2
% 0.11/0.43  % ...aggressively subsumed             : 0
% 0.11/0.43  % Contextual simplify-reflections      : 0
% 0.11/0.43  % Paramodulations                      : 1
% 0.11/0.43  % Factorizations                       : 0
% 0.11/0.43  % NegExts                              : 0
% 0.11/0.43  % Equation resolutions                 : 0
% 0.11/0.43  % Disequality decompositions           : 0
% 0.11/0.43  % Total rewrite steps                  : 16
% 0.11/0.43  % ...of those cached                   : 13
% 0.11/0.43  % Propositional unsat checks           : 0
% 0.11/0.43  %    Propositional check models        : 0
% 0.11/0.43  %    Propositional check unsatisfiable : 0
% 0.11/0.43  %    Propositional clauses             : 0
% 0.11/0.43  %    Propositional clauses after purity: 0
% 0.11/0.43  %    Propositional unsat core size     : 0
% 0.11/0.43  %    Propositional preprocessing time  : 0.000
% 0.11/0.43  %    Propositional encoding time       : 0.000
% 0.11/0.43  %    Propositional solver time         : 0.000
% 0.11/0.43  %    Success case prop preproc time    : 0.000
% 0.11/0.43  %    Success case prop encoding time   : 0.000
% 0.11/0.43  %    Success case prop solver time     : 0.000
% 0.11/0.43  % Current number of processed clauses  : 5
% 0.11/0.43  %    Positive orientable unit clauses  : 3
% 0.11/0.43  %    Positive unorientable unit clauses: 0
% 0.11/0.43  %    Negative unit clauses             : 2
% 0.11/0.43  %    Non-unit-clauses                  : 0
% 0.11/0.43  % Current number of unprocessed clauses: 0
% 0.11/0.43  % ...number of literals in the above   : 0
% 0.11/0.43  % Current number of archived formulas  : 0
% 0.11/0.43  % Current number of archived clauses   : 5
% 0.11/0.43  % Clause-clause subsumption calls (NU) : 0
% 0.11/0.43  % Rec. Clause-clause subsumption calls : 0
% 0.11/0.43  % Non-unit clause-clause subsumptions  : 0
% 0.11/0.43  % Unit Clause-clause subsumption calls : 3
% 0.11/0.43  % Rewrite failures with RHS unbound    : 0
% 0.11/0.43  % BW rewrite match attempts            : 2
% 0.11/0.43  % BW rewrite match successes           : 2
% 0.11/0.43  % Condensation attempts                : 0
% 0.11/0.43  % Condensation successes               : 0
% 0.11/0.43  % Termbank termtop insertions          : 365
% 0.11/0.43  % Search garbage collected termcells   : 20
% 0.11/0.43  
% 0.11/0.43  % -------------------------------------------------
% 0.11/0.43  % User time                : 0.004 s
% 0.11/0.43  % System time              : 0.000 s
% 0.11/0.43  % Total time               : 0.004 s
% 0.11/0.43  % Maximum resident set size: 3576 pages
% 0.11/0.43  
% 0.11/0.43  % -------------------------------------------------
% 0.11/0.43  % User time                : 0.005 s
% 0.11/0.43  % System time              : 0.005 s
% 0.11/0.43  % Total time               : 0.010 s
% 0.11/0.43  % Maximum resident set size: 4608 pages
% 0.11/0.43  % E exiting
%------------------------------------------------------------------------------