↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n003.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 01:37:34 PM UTC 2026

% Result   : Unsatisfiable 45.60s 7.80s
% Output   : CNFRefutation 45.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   41 (  41 unt;   0 def)
%            Number of atoms       :   41 (  34 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 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  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-4 aty)
%            Number of variables   :  115 (   0 sgn 115   !;   0   ?; 103   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    and(n0,n0) = n0,
    file('/export/starexec/sandbox2/benchmark/Axioms/HWC001-0.ax',and_definition1) ).

fof(f2,plain,
    n0 = and(n0,n0),
    inference(reorient_equations,[],[f1]) ).

fof(f3,axiom,
    and(n0,n1) = n0,
    file('/export/starexec/sandbox2/benchmark/Axioms/HWC001-0.ax',and_definition2) ).

fof(f4,plain,
    n0 = and(n0,n1),
    inference(reorient_equations,[],[f3]) ).

fof(f36,axiom,
    ! [X0,X1] : circuit(top(X0),X1,bottom(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsume_symmetric) ).

fof(f37,axiom,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] : and(table(X0,X1,X2,X3),table(X4,X5,X6,X7)) = table(and(X0,X4),and(X1,X5),and(X2,X6),and(X3,X7)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_table_definition) ).

fof(f38,axiom,
    ! [X0] : and(nil,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_definition5) ).

fof(f44,axiom,
    table(n0,n0,n0,n0) = nil,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_table) ).

fof(f45,plain,
    nil = table(n0,n0,n0,n0),
    inference(reorient_equations,[],[f44]) ).

fof(f48,axiom,
    ! [X0] : connect(nil,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',connect_definition1) ).

fof(f52,negated_conjecture,
    ~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_output_configuration) ).

tcf(c_87,plain,
    and(n0,n0) = n0,
    inference(cnf_transformation,[],[f2]) ).

tcf(c_88,plain,
    and(n0,n1) = n0,
    inference(cnf_transformation,[],[f4]) ).

tcf(c_112,plain,
    ! [X0: $i,X1: $i] : circuit(top(X0),X1,bottom(X0)),
    inference(cnf_transformation,[],[f36]) ).

tcf(c_113,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] : table(and(X0,X1),and(X2,X3),and(X4,X5),and(X6,X7)) = and(table(X0,X2,X4,X6),table(X1,X3,X5,X7)),
    inference(cnf_transformation,[],[f37]) ).

tcf(c_114,plain,
    ! [X0: $i] : and(nil,X0) = X0,
    inference(cnf_transformation,[],[f38]) ).

tcf(c_119,plain,
    table(n0,n0,n0,n0) = nil,
    inference(cnf_transformation,[],[f45]) ).

tcf(c_121,plain,
    ! [X0: $i] : connect(nil,X0) = X0,
    inference(cnf_transformation,[],[f48]) ).

tcf(c_124,negated_conjecture,
    ~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))),
    inference(cnf_transformation,[],[f52]) ).

tcf(c_276,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : and(table(X0,n0,X1,X2),table(X3,n0,X4,X5)) = table(and(X0,X3),n0,and(X1,X4),and(X2,X5)),
    inference(superposition,[status(thm)],[c_87,c_113]) ).

tcf(c_277,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : and(table(X0,n0,X1,X2),table(X3,n1,X4,X5)) = table(and(X0,X3),n0,and(X1,X4),and(X2,X5)),
    inference(superposition,[status(thm)],[c_88,c_113]) ).

tcf(c_280,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : and(table(X0,X1,n0,X2),table(X3,X4,n0,X5)) = table(and(X0,X3),and(X1,X4),n0,and(X2,X5)),
    inference(superposition,[status(thm)],[c_87,c_113]) ).

tcf(c_281,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : and(table(X0,X1,n0,X2),table(X3,X4,n1,X5)) = table(and(X0,X3),and(X1,X4),n0,and(X2,X5)),
    inference(superposition,[status(thm)],[c_88,c_113]) ).

tcf(c_284,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : and(table(X0,X1,X2,n0),table(X3,X4,X5,n0)) = table(and(X0,X3),and(X1,X4),and(X2,X5),n0),
    inference(superposition,[status(thm)],[c_87,c_113]) ).

tcf(c_285,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : and(table(X0,X1,X2,n0),table(X3,X4,X5,n1)) = table(and(X0,X3),and(X1,X4),and(X2,X5),n0),
    inference(superposition,[status(thm)],[c_88,c_113]) ).

tcf(c_1531,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : and(table(X0,n0,X1,X2),table(X3,n0,X4,X5)) = and(table(X0,n0,X1,X2),table(X3,n1,X4,X5)),
    inference(demodulation,[status(thm)],[c_277,c_276]) ).

tcf(c_1534,plain,
    ! [X0: $i,X1: $i,X2: $i] : and(nil,table(X0,n0,X1,X2)) = and(nil,table(X0,n1,X1,X2)),
    inference(superposition,[status(thm)],[c_119,c_1531]) ).

tcf(c_1549,plain,
    ! [X0: $i,X1: $i,X2: $i] : table(X0,n0,X1,X2) = table(X0,n1,X1,X2),
    inference(demodulation,[status(thm)],[c_1534,c_114]) ).

tcf(c_2056,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : and(table(X0,X1,n0,X2),table(X3,X4,n0,X5)) = and(table(X0,X1,n0,X2),table(X3,X4,n1,X5)),
    inference(demodulation,[status(thm)],[c_281,c_280]) ).

tcf(c_2060,plain,
    ! [X0: $i,X1: $i,X2: $i] : and(nil,table(X0,X1,n0,X2)) = and(nil,table(X0,X1,n1,X2)),
    inference(superposition,[status(thm)],[c_119,c_2056]) ).

tcf(c_2079,plain,
    ! [X0: $i,X1: $i,X2: $i] : table(X0,X1,n0,X2) = table(X0,X1,n1,X2),
    inference(demodulation,[status(thm)],[c_2060,c_114]) ).

tcf(c_2820,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] : and(table(X0,X1,X2,nil),table(X3,X4,X5,X6)) = table(and(X0,X3),and(X1,X4),and(X2,X5),X6),
    inference(superposition,[status(thm)],[c_114,c_113]) ).

tcf(c_4004,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : and(table(X0,X1,X2,nil),table(X3,X4,X5,n0)) = and(table(X0,X1,X2,n0),table(X3,X4,X5,n0)),
    inference(demodulation,[status(thm)],[c_284,c_2820]) ).

tcf(c_4010,plain,
    ! [X0: $i,X1: $i,X2: $i] : and(table(n0,n0,n0,nil),table(X0,X1,X2,n0)) = and(nil,table(X0,X1,X2,n0)),
    inference(superposition,[status(thm)],[c_119,c_4004]) ).

tcf(c_4033,plain,
    ! [X0: $i,X1: $i,X2: $i] : and(table(n0,n0,n0,nil),table(X0,X1,X2,n0)) = table(X0,X1,X2,n0),
    inference(demodulation,[status(thm)],[c_4010,c_114]) ).

tcf(c_4958,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : and(table(X0,X1,X2,nil),table(X3,X4,X5,n0)) = and(table(X0,X1,X2,n0),table(X3,X4,X5,n1)),
    inference(demodulation,[status(thm)],[c_285,c_2820]) ).

tcf(c_4964,plain,
    ! [X0: $i,X1: $i,X2: $i] : and(table(n0,n0,n0,nil),table(X0,X1,X2,n0)) = and(nil,table(X0,X1,X2,n1)),
    inference(superposition,[status(thm)],[c_119,c_4958]) ).

tcf(c_4987,plain,
    ! [X0: $i,X1: $i,X2: $i] : table(X0,X1,X2,n0) = table(X0,X1,X2,n1),
    inference(demodulation,[status(thm)],[c_4964,c_114,c_4033]) ).

tcf(c_7784,plain,
    ~ circuit(top(connect(table(n0,n0,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))),
    inference(superposition,[status(thm)],[c_1549,c_124]) ).

tcf(c_7800,plain,
    ~ circuit(top(nil),nil,bottom(nil)),
    inference(demodulation,[status(thm)],[c_7784,c_119,c_121,c_2079,c_4987]) ).

tcf(c_8021,plain,
    $false,
    inference(superposition,[status(thm)],[c_112,c_7800]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : HWC002-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.35  % Computer : n003.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Wed Sep 23 16:20:35 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.39  Running first-order theorem proving
% 0.12/0.39  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.40  
% 0.12/0.40  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40  
% 0.12/0.40  % Detected problem language: tptp
% 0.12/0.41  % Proving...
% 45.60/7.80  % SZS status Started for theBenchmark.p
% 45.60/7.80  % SZS status Unsatisfiable for theBenchmark.p
% 45.60/7.80  
% 45.60/7.80  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 45.60/7.80  
% 45.60/7.80  % ------  iProver source info
% 45.60/7.80  
% 45.60/7.80  % git: date: 2026-07-19 20:42:38 +0200
% 45.60/7.80  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 45.60/7.80  % git: non_committed_changes: false
% 45.60/7.80  
% 45.60/7.80  % ------ Parsing...% successful
% 45.60/7.80  
% 45.60/7.80  
% 45.60/7.80  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 45.60/7.80  
% 45.60/7.80  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e % 
% 45.60/7.80  
% 45.60/7.80  % ------ Preprocessing...% 
% 45.60/7.80  
% 45.60/7.80  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 45.60/7.80  % ------ Proving...
% 45.60/7.80  % ------ Problem Properties 
% 45.60/7.80  
% 45.60/7.80  % 
% 45.60/7.80  % clauses                               38
% 45.60/7.80  % conjectures                           1
% 45.60/7.80  % EPR                                   0
% 45.60/7.80  % Horn                                  38
% 45.60/7.80  % unary                                 23
% 45.60/7.80  % binary                                15
% 45.60/7.80  % lits                                  53
% 45.60/7.80  % lits eq                               20
% 45.60/7.80  % fd_pure                               0
% 45.60/7.80  % fd_pseudo                             0
% 45.60/7.80  % fd_cond                               0
% 45.60/7.80  % fd_pseudo_cond                        0
% 45.60/7.80  % AC symbols                            0
% 45.60/7.80  
% 45.60/7.80  % ------ Input Options Time Limit: Unbounded
% 45.60/7.80  
% 45.60/7.80  
% 45.60/7.80  % ------ 
% 45.60/7.80  % Current options:
% 45.60/7.80  % ------ 
% 45.60/7.80  
% 45.60/7.80  
% 45.60/7.80  % 
% 45.60/7.80  
% 45.60/7.80  % ------ Proving...
% 45.60/7.80  % 
% 45.60/7.80  
% 45.60/7.80  % SZS status Unsatisfiable for theBenchmark.p
% 45.60/7.80  
% 45.60/7.80  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 45.60/7.80  
% 45.60/7.80  
%------------------------------------------------------------------------------