↑ Up

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

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

% Computer : n009.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 07:06:53 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(ifeq_axiom,axiom,
    ! [VAR_0,VAR_1,VAR_2] : ifeq4(VAR_0,VAR_0,VAR_1,VAR_2) = VAR_1,
    file('theBenchmark.p',ifeq_axiom) ).

cnf(c_34,plain,
    ifeq4(A,A,B,C) = B,
    inference(clausify,[status(thm)],[ifeq_axiom]) ).

fof(ifeq_axiom_001,axiom,
    ! [VAR_0,VAR_1,VAR_2] : ifeq3(VAR_0,VAR_0,VAR_1,VAR_2) = VAR_1,
    file('theBenchmark.p',ifeq_axiom_001) ).

cnf(c_35,plain,
    ifeq3(A,A,B,C) = B,
    inference(clausify,[status(thm)],[ifeq_axiom_001]) ).

fof(ax2_395,axiom,
    ifeq4(mtvisible(c_tptp_member3356_mt),true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = true,
    file('theBenchmark.p',ax2_395) ).

cnf(c_38,plain,
    ifeq4(mtvisible(c_tptp_member3356_mt),true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = true,
    inference(clausify,[status(thm)],[ax2_395]) ).

fof(query151,axiom,
    mtvisible(c_tptp_member3356_mt) = true,
    file('theBenchmark.p',query151) ).

cnf(c_55,plain,
    mtvisible(c_tptp_member3356_mt) = true,
    inference(clausify,[status(thm)],[query151]) ).

fof(query151_1,axiom,
    ! [VAR_0] : ifeq3(marriagelicensedocument(VAR_0),true,a,b) = b,
    file('theBenchmark.p',query151_1) ).

cnf(c_57,plain,
    ifeq3(marriagelicensedocument(A),true,a,b) = b,
    inference(clausify,[status(thm)],[query151_1]) ).

fof(goal,axiom,
    a != b,
    file('theBenchmark.p',goal) ).

cnf(c_58,plain,
    a != b,
    inference(clausify,[status(thm)],[goal]) ).

cnf(c_59,plain,
    ifeq4(true,true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = true,
    inference(paramod,[status(thm)],[c_55,c_38]) ).

cnf(c_65,plain,
    true = marriagelicensedocument(c_tptpmarriagelicensedocument),
    inference(paramod,[status(thm)],[c_59,c_34]) ).

cnf(c_60,plain,
    marriagelicensedocument(c_tptpmarriagelicensedocument) = true,
    inference(copy,[status(thm)],[c_65]) ).

cnf(c_61,plain,
    ifeq3(true,true,a,b) = b,
    inference(paramod,[status(thm)],[c_60,c_57]) ).

cnf(c_66,plain,
    b = a,
    inference(paramod,[status(thm)],[c_61,c_35]) ).

cnf(c_67,plain,
    a = b,
    inference(copy,[status(thm)],[c_66]) ).

cnf(c_64,plain,
    $false,
    inference(resolve,[status(thm)],[c_58,c_67]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR051-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n009.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 : Sun Sep 27 00:19:15 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37  % Process 1467479 was started by sandbox on n009,
% 0.09/0.37  % Sun Sep 27 00:19:15 2026
% 0.09/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.46  
% 0.09/0.46  % SInE (scan): 56 to sos (tol 1.5x), 12 to usable (tol 2.0x), 7944 zapped, of 8012 axioms (depth 3).
% 0.09/0.46  
% 0.09/0.46  % From the command line: assign(max_seconds, 300).
% 0.09/0.46  
% 0.09/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.46  
% 0.09/0.46  % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.09/0.46  % Length of proof is 10.
% 0.09/0.46  % Level of proof is 4.
% 0.09/0.46  % Maximum clause weight is 117.000.
% 0.09/0.46  % Given clauses 14.
% 0.09/0.46  
% 0.09/0.46  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------