%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN563-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/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:41:06 PM UTC 2026
% Result : Unsatisfiable 1.42s 1.72s
% Output : CNFRefutation 1.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 13
% Syntax : Number of formulae : 56 ( 56 unt; 0 def)
% Number of atoms : 56 ( 55 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 12 ( 12 usr; 5 con; 0-4 aty)
% Number of variables : 64 ( 0 sgn 64 !; 0 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : ifeq2(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f2,axiom,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_001) ).
fof(f3,negated_conjecture,
! [X0] : p2(X0,X0) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_1) ).
fof(f4,negated_conjecture,
! [X0] : p6(X0,X0) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_2) ).
fof(f5,plain,
! [X0] : true = p6(X0,X0),
inference(reorient_equations,[],[f4]) ).
fof(f6,negated_conjecture,
p2(f4(c7),f4(c8)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_4) ).
fof(f7,plain,
true = p2(f4(c7),f4(c8)),
inference(reorient_equations,[],[f6]) ).
fof(f10,negated_conjecture,
! [X0] : p5(f3(f3(X0)),f3(f4(X0))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p5_7) ).
fof(f11,plain,
! [X0] : true = p5(f3(f3(X0)),f3(f4(X0))),
inference(reorient_equations,[],[f10]) ).
fof(f14,negated_conjecture,
! [X0] : ifeq2(p6(c7,X0),true,p6(c7,f3(X0)),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_9) ).
fof(f15,plain,
! [X0] : true = ifeq2(p6(c7,X0),true,p6(c7,f3(X0)),true),
inference(reorient_equations,[],[f14]) ).
fof(f16,negated_conjecture,
! [X0,X1] : ifeq2(p5(X0,X1),true,p6(f4(X0),X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_10) ).
fof(f17,plain,
! [X0,X1] : true = ifeq2(p5(X0,X1),true,p6(f4(X0),X1),true),
inference(reorient_equations,[],[f16]) ).
fof(f18,negated_conjecture,
! [X0,X1] : ifeq2(p2(X0,X1),true,p2(f3(X0),f3(X1)),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_11) ).
fof(f19,plain,
! [X0,X1] : true = ifeq2(p2(X0,X1),true,p2(f3(X0),f3(X1)),true),
inference(reorient_equations,[],[f18]) ).
fof(f26,negated_conjecture,
! [X2,X0,X1] : ifeq2(p6(X0,X1),true,ifeq2(p5(X1,X2),true,p5(X0,X2),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p5_15) ).
fof(f27,plain,
! [X2,X0,X1] : true = ifeq2(p6(X0,X1),true,ifeq2(p5(X1,X2),true,p5(X0,X2),true),true),
inference(reorient_equations,[],[f26]) ).
fof(f30,negated_conjecture,
! [X2,X3,X0,X1] : ifeq2(p2(X0,X1),true,ifeq2(p2(X2,X3),true,ifeq2(p5(X0,X2),true,p5(X1,X3),true),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p5_17) ).
fof(f31,plain,
! [X2,X3,X0,X1] : true = ifeq2(p2(X0,X1),true,ifeq2(p2(X2,X3),true,ifeq2(p5(X0,X2),true,p5(X1,X3),true),true),true),
inference(reorient_equations,[],[f30]) ).
fof(f34,negated_conjecture,
ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p6_5) ).
fof(f35,plain,
b = ifeq(p6(f4(c7),f3(f4(c8))),true,a,b),
inference(reorient_equations,[],[f34]) ).
fof(f36,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq2(X0,X0,X1,X2) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(X0,X0,X1,X2) = X1,
inference(cnf_transformation,[],[f2]) ).
tcf(c_71,negated_conjecture,
! [X0: $i] : p2(X0,X0) = true,
inference(cnf_transformation,[],[f3]) ).
tcf(c_72,negated_conjecture,
! [X0: $i] : p6(X0,X0) = true,
inference(cnf_transformation,[],[f5]) ).
tcf(c_73,negated_conjecture,
p2(f4(c7),f4(c8)) = true,
inference(cnf_transformation,[],[f7]) ).
tcf(c_75,negated_conjecture,
! [X0: $i] : p5(f3(f3(X0)),f3(f4(X0))) = true,
inference(cnf_transformation,[],[f11]) ).
tcf(c_77,negated_conjecture,
! [X0: $i] : ifeq2(p6(c7,X0),true,p6(c7,f3(X0)),true) = true,
inference(cnf_transformation,[],[f15]) ).
tcf(c_78,negated_conjecture,
! [X0: $i,X1: $i] : ifeq2(p5(X0,X1),true,p6(f4(X0),X1),true) = true,
inference(cnf_transformation,[],[f17]) ).
tcf(c_79,negated_conjecture,
! [X0: $i,X1: $i] : ifeq2(p2(X0,X1),true,p2(f3(X0),f3(X1)),true) = true,
inference(cnf_transformation,[],[f19]) ).
tcf(c_83,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] : ifeq2(p6(X0,X1),true,ifeq2(p5(X1,X2),true,p5(X0,X2),true),true) = true,
inference(cnf_transformation,[],[f27]) ).
tcf(c_85,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] : ifeq2(p2(X0,X1),true,ifeq2(p2(X2,X3),true,ifeq2(p5(X0,X2),true,p5(X1,X3),true),true),true) = true,
inference(cnf_transformation,[],[f31]) ).
tcf(c_87,negated_conjecture,
ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b,
inference(cnf_transformation,[],[f35]) ).
tcf(c_88,negated_conjecture,
a != b,
inference(cnf_transformation,[],[f36]) ).
tcf(c_282,plain,
ifeq2(true,true,p6(c7,f3(c7)),true) = true,
inference(superposition,[status(thm)],[c_72,c_77]) ).
tcf(c_287,plain,
ifeq2(true,true,p2(f3(f4(c7)),f3(f4(c8))),true) = true,
inference(superposition,[status(thm)],[c_73,c_79]) ).
tcf(c_291,plain,
p2(f3(f4(c7)),f3(f4(c8))) = true,
inference(demodulation,[status(thm)],[c_287,c_69]) ).
tcf(c_339,plain,
p6(c7,f3(c7)) = true,
inference(demodulation,[status(thm)],[c_282,c_69]) ).
tcf(c_341,plain,
ifeq2(true,true,p6(c7,f3(f3(c7))),true) = true,
inference(superposition,[status(thm)],[c_339,c_77]) ).
tcf(c_721,plain,
p6(c7,f3(f3(c7))) = true,
inference(demodulation,[status(thm)],[c_341,c_69]) ).
tcf(c_1571,plain,
! [X0: $i,X1: $i] : ifeq2(p2(X0,X1),true,ifeq2(true,true,ifeq2(p5(X0,f3(f4(c7))),true,p5(X1,f3(f4(c8))),true),true),true) = true,
inference(superposition,[status(thm)],[c_291,c_85]) ).
tcf(c_2941,plain,
! [X0: $i,X1: $i] : ifeq2(p2(X0,X1),true,ifeq2(p5(X0,f3(f4(c7))),true,p5(X1,f3(f4(c8))),true),true) = true,
inference(demodulation,[status(thm)],[c_1571,c_69]) ).
tcf(c_2989,plain,
! [X0: $i] : ifeq2(p2(f3(f3(c7)),X0),true,ifeq2(true,true,p5(X0,f3(f4(c8))),true),true) = true,
inference(superposition,[status(thm)],[c_75,c_2941]) ).
tcf(c_3018,plain,
! [X0: $i] : ifeq2(p2(f3(f3(c7)),X0),true,p5(X0,f3(f4(c8))),true) = true,
inference(demodulation,[status(thm)],[c_2989,c_69]) ).
tcf(c_3019,plain,
ifeq2(true,true,p5(f3(f3(c7)),f3(f4(c8))),true) = true,
inference(superposition,[status(thm)],[c_71,c_3018]) ).
tcf(c_5801,plain,
p5(f3(f3(c7)),f3(f4(c8))) = true,
inference(demodulation,[status(thm)],[c_3019,c_69]) ).
tcf(c_5805,plain,
! [X0: $i] : ifeq2(p6(X0,f3(f3(c7))),true,ifeq2(true,true,p5(X0,f3(f4(c8))),true),true) = true,
inference(superposition,[status(thm)],[c_5801,c_83]) ).
tcf(c_5897,plain,
! [X0: $i] : ifeq2(p6(X0,f3(f3(c7))),true,p5(X0,f3(f4(c8))),true) = true,
inference(demodulation,[status(thm)],[c_5805,c_69]) ).
tcf(c_5899,plain,
ifeq2(true,true,p5(c7,f3(f4(c8))),true) = true,
inference(superposition,[status(thm)],[c_721,c_5897]) ).
tcf(c_6037,plain,
p5(c7,f3(f4(c8))) = true,
inference(demodulation,[status(thm)],[c_5899,c_69]) ).
tcf(c_6042,plain,
ifeq2(true,true,p6(f4(c7),f3(f4(c8))),true) = true,
inference(superposition,[status(thm)],[c_6037,c_78]) ).
tcf(c_6074,plain,
p6(f4(c7),f3(f4(c8))) = true,
inference(demodulation,[status(thm)],[c_6042,c_69]) ).
tcf(c_6075,plain,
ifeq(true,true,a,b) = b,
inference(demodulation,[status(thm)],[c_87,c_6074]) ).
tcf(c_6120,plain,
a = b,
inference(demodulation,[status(thm)],[c_6075,c_70]) ).
tcf(c_6121,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6120,c_88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN563-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/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.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 01:40:33 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.40 Running UEQ theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.41
% 0.15/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.41
% 0.15/0.41 % Detected problem language: tptp
% 0.15/0.42 % Proving...
% 1.42/1.72 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.42/1.72 % SZS status Started for theBenchmark.p
% 1.42/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.42/1.72
% 1.42/1.72 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.42/1.72
% 1.42/1.72 % ------ iProver source info
% 1.42/1.72
% 1.42/1.72 % git: date: 2026-07-19 20:42:38 +0200
% 1.42/1.72 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.42/1.72 % git: non_committed_changes: false
% 1.42/1.72
% 1.42/1.72 % ------ Parsing...% successful
% 1.42/1.72
% 1.42/1.72
% 1.42/1.72 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.42/1.72
% 1.42/1.72 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.42/1.72
% 1.42/1.72 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.42/1.72
% 1.42/1.72 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.42/1.72 % ------ Proving...
% 1.42/1.72 % ------ Problem Properties
% 1.42/1.72
% 1.42/1.72 %
% 1.42/1.72 % clauses 20
% 1.42/1.72 % conjectures 18
% 1.42/1.72 % EPR 1
% 1.42/1.72 % Horn 20
% 1.42/1.72 % unary 20
% 1.42/1.72 % binary 0
% 1.42/1.72 % lits 20
% 1.42/1.72 % lits eq 20
% 1.42/1.72 % fd_pure 0
% 1.42/1.72 % fd_pseudo 0
% 1.42/1.72 % fd_cond 0
% 1.42/1.72 % fd_pseudo_cond 0
% 1.42/1.72 % AC symbols 0
% 1.42/1.72
% 1.42/1.72 % ------ Input Options Time Limit: Unbounded
% 1.42/1.72
% 1.42/1.72
% 1.42/1.72 % ------
% 1.42/1.72 % Current options:
% 1.42/1.72 % ------
% 1.42/1.72
% 1.42/1.72
% 1.42/1.72 %
% 1.42/1.72
% 1.42/1.72 % ------ Proving...
% 1.42/1.72 %
% 1.42/1.72
% 1.42/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.42/1.72
% 1.42/1.72 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.42/1.72
% 1.42/1.72
%------------------------------------------------------------------------------