↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n001.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:11:57 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
    ~ theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(rule_1,axiom,
    ( ~ axiom(X1)
    | theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).

cnf(axiom_1_6,axiom,
    axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).

cnf(c_0_3,negated_conjecture,
    ~ theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))),
    inference(fof_simplification,[status(thm)],[prove_this]) ).

cnf(c_0_4,plain,
    ( ~ axiom(X1)
    | theorem(X1) ),
    inference(fof_simplification,[status(thm)],[rule_1]) ).

cnf(c_0_5,negated_conjecture,
    ~ theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))),
    c_0_3 ).

cnf(c_0_6,plain,
    ( ~ axiom(X1)
    | theorem(X1) ),
    c_0_4 ).

cnf(c_0_7,axiom,
    axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
    axiom_1_6 ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL173-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46  % Computer : n001.cluster.edu
% 0.19/0.46  % Model    : x86_64 x86_64
% 0.19/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46  % Memory   : 8046.5625MB
% 0.19/0.46  % OS       : Linux 6.8.0-71-generic
% 0.19/0.46  % CPULimit : 300
% 0.19/0.46  % WCLimit  : 300
% 0.19/0.46  % DateTime : Mon Sep 21 00:14:28 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.46  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.54  Running first-order theorem proving
% 0.24/0.54  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.24/0.60  % Version: 3.5.1
% 0.24/0.60  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.60  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.60  % Starting new_bool_3 with 300s (1) cores
% 0.24/0.60  % Starting new_bool_1 with 300s (1) cores
% 0.24/0.60  % Starting sh5l with 300s (1) cores
% 0.24/0.60  % new_bool_3 with pid 1786499 completed with status 0
% 0.24/0.60  % Result found by new_bool_3
% 0.24/0.60  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.60  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.60  % Starting new_bool_3 with 300s (1) cores
% 0.24/0.60  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.60  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.60  % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.24/0.60  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.60  % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.60  % SubtermCWHack with pid 1786505 completed with status 0
% 0.24/0.60  % Result found by SubtermCWHack
% 0.24/0.60  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.60  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.60  % Starting new_bool_3 with 300s (1) cores
% 0.24/0.60  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.60  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.60  % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.24/0.60  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.60  % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.60  % Preprocessing time       : 0.002 s
% 0.24/0.60  
% 0.24/0.60  % Proof found!
% 0.24/0.60  % SZS status Unsatisfiable
% 0.24/0.60  % SZS output start CNFRefutation
% See solution above
% 0.24/0.60  % Parsed axioms                        : 9
% 0.24/0.60  % Removed by relevancy pruning/SinE    : 0
% 0.24/0.60  % Initial clauses                      : 9
% 0.24/0.60  % Removed in clause preprocessing      : 0
% 0.24/0.60  % Initial clauses in saturation        : 9
% 0.24/0.60  % Processed clauses                    : 44
% 0.24/0.60  % ...of these trivial                  : 1
% 0.24/0.60  % ...subsumed                          : 4
% 0.24/0.60  % ...remaining for further processing  : 39
% 0.24/0.60  % Other redundant clauses eliminated   : 0
% 0.24/0.60  % Clauses deleted for lack of memory   : 0
% 0.24/0.60  % Backward-subsumed                    : 0
% 0.24/0.60  % Backward-rewritten                   : 0
% 0.24/0.60  % Generated clauses                    : 65
% 0.24/0.60  % ...of the previous two non-redundant : 47
% 0.24/0.60  % ...aggressively subsumed             : 0
% 0.24/0.60  % Contextual simplify-reflections      : 0
% 0.24/0.60  % Paramodulations                      : 65
% 0.24/0.60  % Factorizations                       : 0
% 0.24/0.60  % NegExts                              : 0
% 0.24/0.60  % Equation resolutions                 : 0
% 0.24/0.60  % Disequality decompositions           : 0
% 0.24/0.60  % Total rewrite steps                  : 13
% 0.24/0.60  % ...of those cached                   : 2
% 0.24/0.60  % Propositional unsat checks           : 0
% 0.24/0.60  %    Propositional check models        : 0
% 0.24/0.60  %    Propositional check unsatisfiable : 0
% 0.24/0.60  %    Propositional clauses             : 0
% 0.24/0.60  %    Propositional clauses after purity: 0
% 0.24/0.60  %    Propositional unsat core size     : 0
% 0.24/0.60  %    Propositional preprocessing time  : 0.000
% 0.24/0.60  %    Propositional encoding time       : 0.000
% 0.24/0.60  %    Propositional solver time         : 0.000
% 0.24/0.60  %    Success case prop preproc time    : 0.000
% 0.24/0.60  %    Success case prop encoding time   : 0.000
% 0.24/0.60  %    Success case prop solver time     : 0.000
% 0.24/0.60  % Current number of processed clauses  : 39
% 0.24/0.60  %    Positive orientable unit clauses  : 24
% 0.24/0.60  %    Positive unorientable unit clauses: 0
% 0.24/0.60  %    Negative unit clauses             : 1
% 0.24/0.60  %    Non-unit-clauses                  : 14
% 0.24/0.60  % Current number of unprocessed clauses: 12
% 0.24/0.60  % ...number of literals in the above   : 20
% 0.24/0.60  % Current number of archived formulas  : 0
% 0.24/0.60  % Current number of archived clauses   : 0
% 0.24/0.60  % Clause-clause subsumption calls (NU) : 58
% 0.24/0.60  % Rec. Clause-clause subsumption calls : 58
% 0.24/0.60  % Non-unit clause-clause subsumptions  : 4
% 0.24/0.60  % Unit Clause-clause subsumption calls : 16
% 0.24/0.60  % Rewrite failures with RHS unbound    : 0
% 0.24/0.60  % BW rewrite match attempts            : 53
% 0.24/0.60  % BW rewrite match successes           : 0
% 0.24/0.60  % Condensation attempts                : 0
% 0.24/0.60  % Condensation successes               : 0
% 0.24/0.60  % Termbank termtop insertions          : 1195
% 0.24/0.60  % Search garbage collected termcells   : 17
% 0.24/0.60  
% 0.24/0.60  % -------------------------------------------------
% 0.24/0.60  % User time                : 0.007 s
% 0.24/0.60  % System time              : 0.003 s
% 0.24/0.60  % Total time               : 0.010 s
% 0.24/0.60  % Maximum resident set size: 3644 pages
% 0.24/0.60  
% 0.24/0.60  % -------------------------------------------------
% 0.24/0.60  % User time                : 0.010 s
% 0.24/0.60  % System time              : 0.009 s
% 0.24/0.60  % Total time               : 0.019 s
% 0.24/0.60  % Maximum resident set size: 4608 pages
% 0.24/0.60  % E exiting
%------------------------------------------------------------------------------