%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN170-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 : n007.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:21 PM UTC 2026
% Result : Unsatisfiable 4.33s 1.30s
% Output : CNFRefutation 4.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 29 unt; 0 def)
% Number of atoms : 29 ( 28 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 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 : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 33 ( 0 sgn 33 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f51,axiom,
n0(d,c) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_26) ).
fof(f52,plain,
true = n0(d,c),
inference(reorient_equations,[],[f51]) ).
fof(f77,axiom,
! [X0,X1] : ifeq(n0(X0,X1),true,k1(X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_001) ).
fof(f78,plain,
! [X0,X1] : true = ifeq(n0(X0,X1),true,k1(X1),true),
inference(reorient_equations,[],[f77]) ).
fof(f387,axiom,
! [X0] : ifeq(k1(X0),true,p2(X0,X0,X0),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_159) ).
fof(f388,plain,
! [X0] : true = ifeq(k1(X0),true,p2(X0,X0,X0),true),
inference(reorient_equations,[],[f387]) ).
fof(f479,axiom,
! [X0,X1] : ifeq(p2(X0,X1,X1),true,k3(X1,X0,X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_206) ).
fof(f480,plain,
! [X0,X1] : true = ifeq(p2(X0,X1,X1),true,k3(X1,X0,X1),true),
inference(reorient_equations,[],[f479]) ).
fof(f635,axiom,
! [X0,X1] : ifeq(k3(X0,X0,X1),true,p4(X0,X1,X0),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_287) ).
fof(f636,plain,
! [X0,X1] : true = ifeq(k3(X0,X0,X1),true,p4(X0,X1,X0),true),
inference(reorient_equations,[],[f635]) ).
fof(f723,negated_conjecture,
! [X0,X1] : p4(X0,c,X1) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f724,plain,
! [X0,X1] : true != p4(X0,c,X1),
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_438,plain,
n0(d,c) = true,
inference(cnf_transformation,[],[f52]) ).
tcf(c_451,plain,
! [X0: $i,X1: $i] : ifeq(n0(X0,X1),true,k1(X1),true) = true,
inference(cnf_transformation,[],[f78]) ).
tcf(c_606,plain,
! [X0: $i] : ifeq(k1(X0),true,p2(X0,X0,X0),true) = true,
inference(cnf_transformation,[],[f388]) ).
tcf(c_652,plain,
! [X0: $i,X1: $i] : ifeq(p2(X0,X1,X1),true,k3(X1,X0,X1),true) = true,
inference(cnf_transformation,[],[f480]) ).
tcf(c_730,plain,
! [X0: $i,X1: $i] : ifeq(k3(X0,X0,X1),true,p4(X0,X1,X0),true) = true,
inference(cnf_transformation,[],[f636]) ).
tcf(c_774,negated_conjecture,
! [X0: $i,X1: $i] : p4(X0,c,X1) != true,
inference(cnf_transformation,[],[f724]) ).
tcf(c_1092,plain,
ifeq(true,true,k1(c),true) = true,
inference(superposition,[status(thm)],[c_438,c_451]) ).
tcf(c_1112,plain,
k1(c) = true,
inference(demodulation,[status(thm)],[c_1092,c_412]) ).
tcf(c_1155,plain,
ifeq(true,true,p2(c,c,c),true) = true,
inference(superposition,[status(thm)],[c_1112,c_606]) ).
tcf(c_1221,plain,
p2(c,c,c) = true,
inference(demodulation,[status(thm)],[c_1155,c_412]) ).
tcf(c_1513,plain,
ifeq(true,true,k3(c,c,c),true) = true,
inference(superposition,[status(thm)],[c_1221,c_652]) ).
tcf(c_1595,plain,
k3(c,c,c) = true,
inference(demodulation,[status(thm)],[c_1513,c_412]) ).
tcf(c_1857,plain,
ifeq(true,true,p4(c,c,c),true) = true,
inference(superposition,[status(thm)],[c_1595,c_730]) ).
tcf(c_1888,plain,
p4(c,c,c) = true,
inference(demodulation,[status(thm)],[c_1857,c_412]) ).
tcf(c_1889,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1888,c_774]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN170-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.12/0.38 % Computer : n007.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Fri Sep 25 00:20:53 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.41 Running UEQ theorem proving
% 0.12/0.41 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.12/0.42
% 0.12/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42
% 0.12/0.42 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 4.33/1.30 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 4.33/1.30 % SZS status Started for theBenchmark.p
% 4.33/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.33/1.30
% 4.33/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.33/1.30
% 4.33/1.30 % ------ iProver source info
% 4.33/1.30
% 4.33/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.33/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.33/1.30 % git: non_committed_changes: false
% 4.33/1.30
% 4.33/1.30 % ------ Parsing...% successful
% 4.33/1.30
% 4.33/1.30
% 4.33/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.33/1.30 % ------ Proving...
% 4.33/1.30 % ------ Problem Properties
% 4.33/1.30
% 4.33/1.30 %
% 4.33/1.30 % clauses 363
% 4.33/1.30 % conjectures 1
% 4.33/1.30 % EPR 0
% 4.33/1.30 % Horn 363
% 4.33/1.30 % unary 363
% 4.33/1.30 % binary 0
% 4.33/1.30 % lits 363
% 4.33/1.30 % lits eq 363
% 4.33/1.30 % fd_pure 0
% 4.33/1.30 % fd_pseudo 0
% 4.33/1.30 % fd_cond 0
% 4.33/1.30 % fd_pseudo_cond 0
% 4.33/1.30 % AC symbols 0
% 4.33/1.30
% 4.33/1.30 % ------ Input Options Time Limit: Unbounded
% 4.33/1.30
% 4.33/1.30
% 4.33/1.30 % ------
% 4.33/1.30 % Current options:
% 4.33/1.30 % ------
% 4.33/1.30
% 4.33/1.30
% 4.33/1.30 %
% 4.33/1.30
% 4.33/1.30 % ------ Proving...
% 4.33/1.30 %
% 4.33/1.30
% 4.33/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.33/1.30
% 4.33/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.33/1.30
% 4.33/1.30
%------------------------------------------------------------------------------