↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n015.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 02:05:48 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : not(X0) = xor(X0,truth),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_1) ).

fof(f2,axiom,
    ! [X0] : xor(X0,falsehood) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_2) ).

fof(f3,axiom,
    ! [X0] : xor(X0,X0) = falsehood,
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_3) ).

fof(f4,plain,
    ! [X0] : falsehood = xor(X0,X0),
    inference(reorient_equations,[],[f3]) ).

fof(f8,axiom,
    ! [X0] : and_star(xor(truth,X0),X0) = falsehood,
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_6) ).

fof(f9,plain,
    ! [X0] : falsehood = and_star(xor(truth,X0),X0),
    inference(reorient_equations,[],[f8]) ).

fof(f10,axiom,
    ! [X0,X1] : xor(X0,xor(truth,X1)) = xor(xor(X0,truth),X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_7) ).

fof(f12,axiom,
    ! [X0,X1] : xor(X0,X1) = xor(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_commutativity) ).

fof(f13,axiom,
    ! [X2,X0,X1] : and_star(and_star(X0,X1),X2) = and_star(X0,and_star(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_star_associativity) ).

fof(f14,axiom,
    ! [X0,X1] : and_star(X0,X1) = and_star(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_star_commutativity) ).

fof(f17,axiom,
    ! [X0,X1] : implies(X0,X1) = xor(truth,and_star(X0,xor(truth,X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).

fof(f18,negated_conjecture,
    implies(implies(not(x),not(y)),implies(y,x)) != truth,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wajsberg_axiom) ).

fof(f19,plain,
    truth != implies(implies(not(x),not(y)),implies(y,x)),
    inference(reorient_equations,[],[f18]) ).

fof(f21,plain,
    truth != xor(truth,and_star(xor(truth,and_star(xor(x,truth),xor(truth,xor(y,truth)))),xor(truth,xor(truth,and_star(y,xor(truth,x)))))),
    inference(definition_unfolding,[],[f19,f17,f17,f1,f1,f17]) ).

tcf(c_63,plain,
    ! [X0: $i] : xor(X0,falsehood) = X0,
    inference(cnf_transformation,[],[f2]) ).

tcf(c_64,plain,
    ! [X0: $i] : xor(X0,X0) = falsehood,
    inference(cnf_transformation,[],[f4]) ).

tcf(c_67,plain,
    ! [X0: $i] : and_star(xor(truth,X0),X0) = falsehood,
    inference(cnf_transformation,[],[f9]) ).

tcf(c_68,plain,
    ! [X0: $i,X1: $i] : xor(xor(X0,truth),X1) = xor(X0,xor(truth,X1)),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_70,plain,
    ! [X0: $i,X1: $i] : xor(X0,X1) = xor(X1,X0),
    inference(cnf_transformation,[],[f12]) ).

tcf(c_71,plain,
    ! [X0: $i,X1: $i,X2: $i] : and_star(and_star(X0,X1),X2) = and_star(X0,and_star(X1,X2)),
    inference(cnf_transformation,[],[f13]) ).

tcf(c_72,plain,
    ! [X0: $i,X1: $i] : and_star(X0,X1) = and_star(X1,X0),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_74,negated_conjecture,
    xor(truth,and_star(xor(truth,and_star(xor(x,truth),xor(truth,xor(y,truth)))),xor(truth,xor(truth,and_star(y,xor(truth,x)))))) != truth,
    inference(cnf_transformation,[],[f21]) ).

tcf(c_84,plain,
    ! [X0: $i] : and_star(X0,xor(truth,X0)) = falsehood,
    inference(theory_normalisation,[status(thm)],[c_67,c_71,c_72]) ).

tcf(c_86,negated_conjecture,
    xor(truth,and_star(xor(truth,xor(truth,and_star(y,xor(truth,x)))),xor(truth,and_star(xor(x,truth),xor(truth,xor(y,truth)))))) != truth,
    inference(theory_normalisation,[status(thm)],[c_74,c_71,c_72]) ).

tcf(c_112,plain,
    xor(truth,and_star(xor(truth,xor(truth,and_star(y,xor(truth,x)))),xor(truth,and_star(xor(truth,x),xor(truth,xor(truth,y)))))) != truth,
    inference(demodulation,[status(thm)],[c_86,c_70]) ).

tcf(c_194,plain,
    ! [X0: $i] : xor(falsehood,X0) = X0,
    inference(superposition,[status(thm)],[c_63,c_70]) ).

tcf(c_223,plain,
    ! [X0: $i] : xor(truth,xor(truth,X0)) = xor(falsehood,X0),
    inference(superposition,[status(thm)],[c_64,c_68]) ).

tcf(c_231,plain,
    ! [X0: $i] : xor(truth,xor(truth,X0)) = X0,
    inference(light_normalisation,[status(thm)],[c_223,c_194]) ).

tcf(c_232,plain,
    xor(truth,and_star(xor(truth,xor(truth,and_star(y,xor(truth,x)))),xor(truth,and_star(xor(truth,x),y)))) != truth,
    inference(demodulation,[status(thm)],[c_112,c_231]) ).

tcf(c_233,plain,
    xor(truth,and_star(xor(truth,and_star(y,xor(truth,x))),xor(truth,xor(truth,and_star(y,xor(truth,x)))))) != truth,
    inference(theory_normalisation,[status(thm)],[c_232,c_71,c_72]) ).

tcf(c_234,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_233,c_63,c_84]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL164-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36  % Computer : n015.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 : Wed Sep 23 22:10:55 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39  Running UEQ theorem proving
% 0.13/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.13/0.40  
% 0.13/0.40  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40  
% 0.13/0.41  % Detected problem language: tptp
% 0.13/0.42  % Proving...
% 1.27/1.17  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.27/1.17  % SZS status Started for theBenchmark.p
% 1.27/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.17  
% 1.27/1.17  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.27/1.17  
% 1.27/1.17  % ------  iProver source info
% 1.27/1.17  
% 1.27/1.17  % git: date: 2026-07-19 20:42:38 +0200
% 1.27/1.17  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.27/1.17  % git: non_committed_changes: false
% 1.27/1.17  
% 1.27/1.17  % ------ Parsing...% successful
% 1.27/1.17  
% 1.27/1.17  
% 1.27/1.17  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.27/1.17  
% 1.27/1.17  % ------ Preprocessing... sup_sim: 2  sf_s  rm: 0 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.27/1.17  
% 1.27/1.17  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.27/1.17  
% 1.27/1.17  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 1.27/1.17  % ------ Proving...
% 1.27/1.17  % ------ Problem Properties 
% 1.27/1.17  
% 1.27/1.17  % 
% 1.27/1.17  % clauses                               11
% 1.27/1.17  % conjectures                           0
% 1.27/1.17  % EPR                                   0
% 1.27/1.17  % Horn                                  11
% 1.27/1.17  % unary                                 11
% 1.27/1.17  % binary                                0
% 1.27/1.17  % lits                                  11
% 1.27/1.17  % lits eq                               11
% 1.27/1.17  % fd_pure                               0
% 1.27/1.17  % fd_pseudo                             0
% 1.27/1.17  % fd_cond                               0
% 1.27/1.17  % fd_pseudo_cond                        0
% 1.27/1.17  % AC symbols                            1
% 1.27/1.17  
% 1.27/1.17  % ------ Input Options Time Limit: Unbounded
% 1.27/1.17  
% 1.27/1.17  
% 1.27/1.17  % ------ 
% 1.27/1.17  % Current options:
% 1.27/1.17  % ------ 
% 1.27/1.17  
% 1.27/1.17  
% 1.27/1.17  % 
% 1.27/1.17  
% 1.27/1.17  % ------ Proving...
% 1.27/1.17  % 
% 1.27/1.17  
% 1.27/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.17  
% 1.27/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.27/1.17  
% 1.27/1.17  
%------------------------------------------------------------------------------