↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN116-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n014.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 : Fri Sep 25 03:39:13 PM UTC 2026

% Result   : Unsatisfiable 4.02s 1.20s
% Output   : CNFRefutation 4.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   54 (  54 unt;   0 def)
%            Number of atoms       :   54 (  53 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   3 con; 0-4 aty)
%            Number of variables   :   58 (   0 sgn  58   !;   0   ?;  27   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).

fof(f17,axiom,
    r0(b) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).

fof(f18,plain,
    true = r0(b),
    inference(reorient_equations,[],[f17]) ).

fof(f27,axiom,
    ! [X0] : p0(b,X0) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).

fof(f28,plain,
    ! [X0] : true = p0(b,X0),
    inference(reorient_equations,[],[f27]) ).

fof(f59,axiom,
    n0(e,e) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_30) ).

fof(f60,plain,
    true = n0(e,e),
    inference(reorient_equations,[],[f59]) ).

fof(f79,axiom,
    ! [X0,X1] : ifeq(n0(X0,X1),true,l1(X1,X1),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_002) ).

fof(f80,plain,
    ! [X0,X1] : true = ifeq(n0(X0,X1),true,l1(X1,X1),true),
    inference(reorient_equations,[],[f79]) ).

fof(f187,axiom,
    ! [X0] : ifeq(r0(X0),true,n1(X0,X0,X0),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_057) ).

fof(f188,plain,
    ! [X0] : true = ifeq(r0(X0),true,n1(X0,X0,X0),true),
    inference(reorient_equations,[],[f187]) ).

fof(f241,axiom,
    ! [X0,X1] : ifeq(p0(X0,X1),true,p1(X1,X1,X1),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_085) ).

fof(f242,plain,
    ! [X0,X1] : true = ifeq(p0(X0,X1),true,p1(X1,X1,X1),true),
    inference(reorient_equations,[],[f241]) ).

fof(f343,axiom,
    ! [X2,X0,X1] : ifeq(p1(X0,X1,X2),true,n2(X2),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_137) ).

fof(f344,plain,
    ! [X2,X0,X1] : true = ifeq(p1(X0,X1,X2),true,n2(X2),true),
    inference(reorient_equations,[],[f343]) ).

fof(f553,axiom,
    ! [X0] : ifeq(n2(X0),true,p3(X0,X0,X0),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_244) ).

fof(f554,plain,
    ! [X0] : true = ifeq(n2(X0),true,p3(X0,X0,X0),true),
    inference(reorient_equations,[],[f553]) ).

fof(f659,axiom,
    ! [X2,X3,X0,X1] : ifeq(p3(X0,X1,X2),true,ifeq(l1(X3,X1),true,s4(X3),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_299) ).

fof(f660,plain,
    ! [X2,X3,X0,X1] : true = ifeq(p3(X0,X1,X2),true,ifeq(l1(X3,X1),true,s4(X3),true),true),
    inference(reorient_equations,[],[f659]) ).

fof(f663,axiom,
    ifeq(s4(e),true,ifeq(n1(b,b,b),true,k5(b),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_301) ).

fof(f664,plain,
    true = ifeq(s4(e),true,ifeq(n1(b,b,b),true,k5(b),true),true),
    inference(reorient_equations,[],[f663]) ).

fof(f723,negated_conjecture,
    k5(b) != true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f724,plain,
    true != k5(b),
    inference(reorient_equations,[],[f723]) ).

tcf(c_412,plain,
    ! [X0: $i,X1: $i,X2: $i] : ifeq(X0,X0,X1,X2) = X1,
    inference(cnf_transformation,[],[f1]) ).

tcf(c_421,plain,
    r0(b) = true,
    inference(cnf_transformation,[],[f18]) ).

tcf(c_426,plain,
    ! [X0: $i] : p0(b,X0) = true,
    inference(cnf_transformation,[],[f28]) ).

tcf(c_442,plain,
    n0(e,e) = true,
    inference(cnf_transformation,[],[f60]) ).

tcf(c_452,plain,
    ! [X0: $i,X1: $i] : ifeq(n0(X0,X1),true,l1(X1,X1),true) = true,
    inference(cnf_transformation,[],[f80]) ).

tcf(c_506,plain,
    ! [X0: $i] : ifeq(r0(X0),true,n1(X0,X0,X0),true) = true,
    inference(cnf_transformation,[],[f188]) ).

tcf(c_533,plain,
    ! [X0: $i,X1: $i] : ifeq(p0(X0,X1),true,p1(X1,X1,X1),true) = true,
    inference(cnf_transformation,[],[f242]) ).

tcf(c_584,plain,
    ! [X0: $i,X1: $i,X2: $i] : ifeq(p1(X0,X1,X2),true,n2(X2),true) = true,
    inference(cnf_transformation,[],[f344]) ).

tcf(c_689,plain,
    ! [X0: $i] : ifeq(n2(X0),true,p3(X0,X0,X0),true) = true,
    inference(cnf_transformation,[],[f554]) ).

tcf(c_742,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : ifeq(p3(X0,X1,X2),true,ifeq(l1(X3,X1),true,s4(X3),true),true) = true,
    inference(cnf_transformation,[],[f660]) ).

tcf(c_744,plain,
    ifeq(s4(e),true,ifeq(n1(b,b,b),true,k5(b),true),true) = true,
    inference(cnf_transformation,[],[f664]) ).

tcf(c_774,negated_conjecture,
    k5(b) != true,
    inference(cnf_transformation,[],[f724]) ).

tcf(c_1101,plain,
    ifeq(true,true,l1(e,e),true) = true,
    inference(superposition,[status(thm)],[c_442,c_452]) ).

tcf(c_1115,plain,
    l1(e,e) = true,
    inference(demodulation,[status(thm)],[c_1101,c_412]) ).

tcf(c_1142,plain,
    ifeq(true,true,n1(b,b,b),true) = true,
    inference(superposition,[status(thm)],[c_421,c_506]) ).

tcf(c_1228,plain,
    n1(b,b,b) = true,
    inference(demodulation,[status(thm)],[c_1142,c_412]) ).

tcf(c_1277,plain,
    ! [X0: $i] : ifeq(true,true,p1(X0,X0,X0),true) = true,
    inference(superposition,[status(thm)],[c_426,c_533]) ).

tcf(c_1626,plain,
    ! [X0: $i] : p1(X0,X0,X0) = true,
    inference(demodulation,[status(thm)],[c_1277,c_412]) ).

tcf(c_2176,plain,
    ! [X0: $i] : ifeq(true,true,n2(X0),true) = true,
    inference(superposition,[status(thm)],[c_1626,c_584]) ).

tcf(c_2190,plain,
    ! [X0: $i] : n2(X0) = true,
    inference(demodulation,[status(thm)],[c_2176,c_412]) ).

tcf(c_2201,plain,
    ! [X0: $i] : ifeq(true,true,p3(X0,X0,X0),true) = true,
    inference(demodulation,[status(thm)],[c_689,c_2190]) ).

tcf(c_2204,plain,
    ! [X0: $i] : p3(X0,X0,X0) = true,
    inference(demodulation,[status(thm)],[c_2201,c_412]) ).

tcf(c_2765,plain,
    ! [X0: $i,X1: $i] : ifeq(true,true,ifeq(l1(X0,X1),true,s4(X0),true),true) = true,
    inference(superposition,[status(thm)],[c_2204,c_742]) ).

tcf(c_2889,plain,
    ! [X0: $i,X1: $i] : ifeq(l1(X0,X1),true,s4(X0),true) = true,
    inference(demodulation,[status(thm)],[c_2765,c_412]) ).

tcf(c_3153,plain,
    ifeq(true,true,s4(e),true) = true,
    inference(superposition,[status(thm)],[c_1115,c_2889]) ).

tcf(c_3174,plain,
    s4(e) = true,
    inference(demodulation,[status(thm)],[c_3153,c_412]) ).

tcf(c_3179,plain,
    ifeq(true,true,ifeq(n1(b,b,b),true,k5(b),true),true) = true,
    inference(demodulation,[status(thm)],[c_744,c_3174]) ).

tcf(c_3180,plain,
    ifeq(n1(b,b,b),true,k5(b),true) = true,
    inference(demodulation,[status(thm)],[c_3179,c_412]) ).

tcf(c_3181,plain,
    ifeq(true,true,k5(b),true) = true,
    inference(light_normalisation,[status(thm)],[c_3180,c_1228]) ).

tcf(c_3182,plain,
    k5(b) = true,
    inference(demodulation,[status(thm)],[c_3181,c_412]) ).

tcf(c_3183,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3182,c_774]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN116-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.39  % Computer : n014.cluster.edu
% 0.11/0.39  % Model    : x86_64 x86_64
% 0.11/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39  % Memory   : 8046.5625MB
% 0.11/0.39  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Fri Sep 25 00:13:02 UTC 2026
% 0.11/0.40  % CPUTime  : 
% 0.11/0.40  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.43  Running UEQ theorem proving
% 0.11/0.43  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.44  
% 0.11/0.44  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.44  
% 0.11/0.44  % Detected problem language: tptp
% 0.11/0.45  % Proving...
% 4.02/1.20  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 4.02/1.20  % SZS status Started for theBenchmark.p
% 4.02/1.20  % SZS status Unsatisfiable for theBenchmark.p
% 4.02/1.20  
% 4.02/1.20  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.02/1.20  
% 4.02/1.20  % ------  iProver source info
% 4.02/1.20  
% 4.02/1.20  % git: date: 2026-07-19 20:42:38 +0200
% 4.02/1.20  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.02/1.20  % git: non_committed_changes: false
% 4.02/1.20  
% 4.02/1.20  % ------ Parsing...% successful
% 4.02/1.20  
% 4.02/1.20  
% 4.02/1.20  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 4.02/1.20  % ------ Proving...
% 4.02/1.20  % ------ Problem Properties 
% 4.02/1.20  
% 4.02/1.20  % 
% 4.02/1.20  % clauses                               363
% 4.02/1.20  % conjectures                           1
% 4.02/1.20  % EPR                                   0
% 4.02/1.20  % Horn                                  363
% 4.02/1.20  % unary                                 363
% 4.02/1.20  % binary                                0
% 4.02/1.20  % lits                                  363
% 4.02/1.20  % lits eq                               363
% 4.02/1.20  % fd_pure                               0
% 4.02/1.20  % fd_pseudo                             0
% 4.02/1.20  % fd_cond                               0
% 4.02/1.20  % fd_pseudo_cond                        0
% 4.02/1.20  % AC symbols                            0
% 4.02/1.20  
% 4.02/1.20  % ------ Input Options Time Limit: Unbounded
% 4.02/1.20  
% 4.02/1.20  
% 4.02/1.20  % ------ 
% 4.02/1.20  % Current options:
% 4.02/1.20  % ------ 
% 4.02/1.20  
% 4.02/1.20  
% 4.02/1.20  % 
% 4.02/1.20  
% 4.02/1.20  % ------ Proving...
% 4.02/1.20  % 
% 4.02/1.20  
% 4.02/1.20  % SZS status Unsatisfiable for theBenchmark.p
% 4.02/1.20  
% 4.02/1.20  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.02/1.20  
% 4.02/1.20  
%------------------------------------------------------------------------------