↑ Up

Prover9---2026-6A.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : MSC005-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n018.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 : Sun Sep 27 08:04:16 AM UTC 2026

% Result   : Unsatisfiable 0.18s 0.46s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   21 (  11 unt;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   37 (  21   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   18 (   1 sgn   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(true_is_true,axiom,
    value(truth,truth),
    file('theBenchmark.p',true_is_true) ).

cnf(c_1,plain,
    value(truth,truth),
    inference(clausify,[status(thm)],[true_is_true]) ).

fof(false_is_false,axiom,
    value(falsity,falsity),
    file('theBenchmark.p',false_is_false) ).

cnf(c_2,plain,
    value(falsity,falsity),
    inference(clausify,[status(thm)],[false_is_false]) ).

fof(true_xor_true,axiom,
    ! [VAR_0,VAR_1] :
      ( value(xor(VAR_0,VAR_1),falsity)
      | ~ value(VAR_1,truth)
      | ~ value(VAR_0,truth) ),
    file('theBenchmark.p',true_xor_true) ).

cnf(c_3,plain,
    ( value(xor(A,B),falsity)
    | ~ value(B,truth)
    | ~ value(A,truth) ),
    inference(clausify,[status(thm)],[true_xor_true]) ).

fof(true_xor_false,axiom,
    ! [VAR_0,VAR_1] :
      ( value(xor(VAR_0,VAR_1),truth)
      | ~ value(VAR_1,falsity)
      | ~ value(VAR_0,truth) ),
    file('theBenchmark.p',true_xor_false) ).

cnf(c_4,plain,
    ( value(xor(A,B),truth)
    | ~ value(B,falsity)
    | ~ value(A,truth) ),
    inference(clausify,[status(thm)],[true_xor_false]) ).

fof(false_xor_false,axiom,
    ! [VAR_0,VAR_1] :
      ( value(xor(VAR_0,VAR_1),falsity)
      | ~ value(VAR_1,falsity)
      | ~ value(VAR_0,falsity) ),
    file('theBenchmark.p',false_xor_false) ).

cnf(c_6,plain,
    ( value(xor(A,B),falsity)
    | ~ value(B,falsity)
    | ~ value(A,falsity) ),
    inference(clausify,[status(thm)],[false_xor_false]) ).

fof(evaluate_expression,axiom,
    ! [VAR_0] : ~ value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),VAR_0),
    file('theBenchmark.p',evaluate_expression) ).

cnf(c_7,plain,
    ~ value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),A),
    inference(clausify,[status(thm)],[evaluate_expression]) ).

cnf(c_30,plain,
    ( value(xor(truth,A),truth)
    | ~ value(A,falsity) ),
    inference(resolve,[status(thm)],[c_4,c_1]) ).

cnf(c_9,plain,
    value(xor(truth,falsity),truth),
    inference(resolve,[status(thm)],[c_30,c_2]) ).

cnf(c_31,plain,
    ( value(xor(A,falsity),falsity)
    | ~ value(A,falsity) ),
    inference(resolve,[status(thm)],[c_6,c_2]) ).

cnf(c_16,plain,
    ~ value(xor(xor(xor(truth,falsity),falsity),truth),falsity),
    inference(resolve,[status(thm)],[c_31,c_7]) ).

cnf(c_32,plain,
    ( value(xor(A,truth),falsity)
    | ~ value(A,truth) ),
    inference(resolve,[status(thm)],[c_3,c_1]) ).

cnf(c_25,plain,
    ~ value(xor(xor(truth,falsity),falsity),truth),
    inference(resolve,[status(thm)],[c_32,c_16]) ).

cnf(c_33,plain,
    ( value(xor(A,falsity),truth)
    | ~ value(A,truth) ),
    inference(resolve,[status(thm)],[c_4,c_2]) ).

cnf(c_28,plain,
    ~ value(xor(truth,falsity),truth),
    inference(resolve,[status(thm)],[c_33,c_25]) ).

cnf(c_29,plain,
    $false,
    inference(resolve,[status(thm)],[c_28,c_9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : MSC005-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.43  % Computer : n018.cluster.edu
% 0.18/0.43  % Model    : x86_64 x86_64
% 0.18/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43  % Memory   : 8046.5625MB
% 0.18/0.43  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Sat Sep 26 00:16:36 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.44  % Process 3196792 was started by sandbox on n018,
% 0.18/0.44  % Sat Sep 26 00:16:36 2026
% 0.18/0.44  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.18/0.45  
% 0.18/0.45  % From the command line: assign(max_seconds, 300).
% 0.18/0.46  
% 0.18/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.46  
% 0.18/0.46  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.18/0.46  % Length of proof is 11.
% 0.18/0.46  % Level of proof is 4.
% 0.18/0.46  % Maximum clause weight is 11.000.
% 0.18/0.46  % Given clauses 10.
% 0.18/0.46  
% 0.18/0.46  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------