↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWX200-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p 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 : Fri Sep 25 03:32:49 PM UTC 2026

% Result   : Unsatisfiable 2.15s 1.27s
% Output   : CNFRefutation 2.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   33 (  33 unt;   0 def)
%            Number of atoms       :   33 (  32 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    8 (   8   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    7 (   2 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    :   13 (  13 usr;   4 con; 0-4 aty)
%            Number of variables   :   42 (   0 sgn  42   !;   0   ?;  19   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X2,X0,X1] : aux2(X0,X1,X2,bfalse) = bfalse,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_003) ).

fof(f5,plain,
    ! [X2,X0,X1] : bfalse = aux2(X0,X1,X2,bfalse),
    inference(reorient_equations,[],[f4]) ).

fof(f8,axiom,
    ! [X0] : leqNat(s(X0),z) = bfalse,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_005) ).

fof(f9,plain,
    ! [X0] : bfalse = leqNat(s(X0),z),
    inference(reorient_equations,[],[f8]) ).

fof(f11,axiom,
    ! [X0] : merge(nil,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_007) ).

fof(f15,axiom,
    ord(nil) = btrue,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_010) ).

fof(f16,plain,
    btrue = ord(nil),
    inference(reorient_equations,[],[f15]) ).

fof(f19,axiom,
    ! [X2,X0,X1] : ord(cons(X0,cons(X1,X2))) = aux2(X0,X1,X2,leqNat(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_012) ).

fof(f20,axiom,
    ! [X0] : impl(btrue,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_013) ).

fof(f23,axiom,
    ! [X0,X1] : prop_merge_ord_not3(X0,X1) = impl(eq2(ord(X0),btrue),impl(eq2(ord(X1),bfalse),eq2(ord(merge(X0,X1)),btrue))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_015) ).

fof(f24,axiom,
    eq2(bfalse,btrue) = bfalse,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_016) ).

fof(f25,plain,
    bfalse = eq2(bfalse,btrue),
    inference(reorient_equations,[],[f24]) ).

fof(f35,axiom,
    ! [X0] : eq2(X0,X0) = btrue,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_022) ).

fof(f36,plain,
    ! [X0] : btrue = eq2(X0,X0),
    inference(reorient_equations,[],[f35]) ).

fof(f37,negated_conjecture,
    ! [X0,X1] : eq2(prop_merge_ord_not3(X0,X1),bfalse) != btrue,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).

fof(f38,plain,
    ! [X0,X1] : btrue != eq2(prop_merge_ord_not3(X0,X1),bfalse),
    inference(reorient_equations,[],[f37]) ).

fof(f39,plain,
    ! [X0,X1] : btrue != eq2(impl(eq2(ord(X0),btrue),impl(eq2(ord(X1),bfalse),eq2(ord(merge(X0,X1)),btrue))),bfalse),
    inference(definition_unfolding,[],[f38,f23]) ).

tcf(c_76,plain,
    ! [X0: $i,X1: $i,X2: $i] : aux2(X0,X1,X2,bfalse) = bfalse,
    inference(cnf_transformation,[],[f5]) ).

tcf(c_78,plain,
    ! [X0: $i] : leqNat(s(X0),z) = bfalse,
    inference(cnf_transformation,[],[f9]) ).

tcf(c_80,plain,
    ! [X0: $i] : merge(nil,X0) = X0,
    inference(cnf_transformation,[],[f11]) ).

tcf(c_83,plain,
    ord(nil) = btrue,
    inference(cnf_transformation,[],[f16]) ).

tcf(c_85,plain,
    ! [X0: $i,X1: $i,X2: $i] : aux2(X0,X1,X2,leqNat(X0,X1)) = ord(cons(X0,cons(X1,X2))),
    inference(cnf_transformation,[],[f19]) ).

tcf(c_86,plain,
    ! [X0: $i] : impl(btrue,X0) = X0,
    inference(cnf_transformation,[],[f20]) ).

tcf(c_88,plain,
    eq2(bfalse,btrue) = bfalse,
    inference(cnf_transformation,[],[f25]) ).

tcf(c_94,plain,
    ! [X0: $i] : eq2(X0,X0) = btrue,
    inference(cnf_transformation,[],[f36]) ).

tcf(c_95,negated_conjecture,
    ! [X0: $i,X1: $i] : eq2(impl(eq2(ord(X0),btrue),impl(eq2(ord(X1),bfalse),eq2(ord(merge(X0,X1)),btrue))),bfalse) != btrue,
    inference(cnf_transformation,[],[f39]) ).

tcf(c_294,plain,
    ! [X0: $i] : eq2(impl(eq2(btrue,btrue),impl(eq2(ord(X0),bfalse),eq2(ord(merge(nil,X0)),btrue))),bfalse) != btrue,
    inference(superposition,[status(thm)],[c_83,c_95]) ).

tcf(c_297,plain,
    ! [X0: $i] : eq2(impl(eq2(btrue,btrue),impl(eq2(ord(X0),bfalse),eq2(ord(X0),btrue))),bfalse) != btrue,
    inference(light_normalisation,[status(thm)],[c_294,c_80]) ).

tcf(c_302,plain,
    ! [X0: $i] : eq2(impl(eq2(ord(X0),bfalse),eq2(ord(X0),btrue)),bfalse) != btrue,
    inference(demodulation,[status(thm)],[c_297,c_86,c_94]) ).

tcf(c_356,plain,
    ! [X0: $i,X1: $i] : ord(cons(s(X0),cons(z,X1))) = aux2(s(X0),z,X1,bfalse),
    inference(superposition,[status(thm)],[c_78,c_85]) ).

tcf(c_374,plain,
    ! [X0: $i,X1: $i] : ord(cons(s(X0),cons(z,X1))) = bfalse,
    inference(demodulation,[status(thm)],[c_356,c_76]) ).

tcf(c_378,plain,
    eq2(impl(eq2(bfalse,bfalse),eq2(bfalse,btrue)),bfalse) != btrue,
    inference(superposition,[status(thm)],[c_374,c_302]) ).

tcf(c_383,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_378,c_86,c_88,c_94]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWX200-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36  % Computer : n017.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Thu Sep 24 23:31:46 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.39  Running UEQ theorem proving
% 0.14/0.39  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.14/0.41  
% 0.14/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41  
% 0.14/0.41  % Detected problem language: tptp
% 0.14/0.42  % Proving...
% 2.15/1.27  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.15/1.27  % SZS status Started for theBenchmark.p
% 2.15/1.27  % SZS status Unsatisfiable for theBenchmark.p
% 2.15/1.27  
% 2.15/1.27  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.15/1.27  
% 2.15/1.27  % ------  iProver source info
% 2.15/1.27  
% 2.15/1.27  % git: date: 2026-07-19 20:42:38 +0200
% 2.15/1.27  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.15/1.27  % git: non_committed_changes: false
% 2.15/1.27  
% 2.15/1.27  % ------ Parsing...% successful
% 2.15/1.27  
% 2.15/1.27  
% 2.15/1.27  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.15/1.27  
% 2.15/1.27  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 2.15/1.27  
% 2.15/1.27  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.15/1.27  
% 2.15/1.27  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 2.15/1.27  % ------ Proving...
% 2.15/1.27  % ------ Problem Properties 
% 2.15/1.27  
% 2.15/1.27  % 
% 2.15/1.27  % clauses                               23
% 2.15/1.27  % conjectures                           1
% 2.15/1.27  % EPR                                   0
% 2.15/1.27  % Horn                                  23
% 2.15/1.27  % unary                                 23
% 2.15/1.27  % binary                                0
% 2.15/1.27  % lits                                  23
% 2.15/1.27  % lits eq                               23
% 2.15/1.27  % fd_pure                               0
% 2.15/1.27  % fd_pseudo                             0
% 2.15/1.27  % fd_cond                               0
% 2.15/1.27  % fd_pseudo_cond                        0
% 2.15/1.27  % AC symbols                            0
% 2.15/1.27  
% 2.15/1.27  % ------ Input Options Time Limit: Unbounded
% 2.15/1.27  
% 2.15/1.27  
% 2.15/1.27  % ------ 
% 2.15/1.27  % Current options:
% 2.15/1.27  % ------ 
% 2.15/1.27  
% 2.15/1.27  
% 2.15/1.27  % 
% 2.15/1.27  
% 2.15/1.27  % ------ Proving...
% 2.15/1.27  % 
% 2.15/1.27  
% 2.15/1.27  % SZS status Unsatisfiable for theBenchmark.p
% 2.15/1.27  
% 2.15/1.27  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.15/1.27  
% 2.15/1.27  
%------------------------------------------------------------------------------