%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ALG011-1 : TPTP v9.3.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/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 12:53:09 PM UTC 2026
% Result : Unsatisfiable 1.97s 1.28s
% Output : CNFRefutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 39 ( 7 unt; 0 def)
% Number of atoms : 96 ( 3 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 107 ( 50 ~; 57 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn 80 !; 0 ?; 71 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : f(X0,f(X1,X2)) = f(f(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f_is_associative) ).
fof(f2,axiom,
! [X0] :
( d(X0)
| c(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',partitions_union) ).
fof(f3,axiom,
! [X0] :
( ~ d(X0)
| ~ c(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',partitions_exclusive) ).
fof(f4,axiom,
c(a1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',partition_c_not_empty) ).
fof(f6,negated_conjecture,
! [X0,X1] :
( ~ c(X1)
| ~ c(X0)
| d(f(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture_1) ).
fof(f7,negated_conjecture,
! [X0,X1] :
( ~ d(X1)
| ~ d(X0)
| c(f(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture_2) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] : f(f(X0,X1),X2) = f(X0,f(X1,X2)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_57,plain,
! [X0: $i] :
( d(X0)
| c(X0) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_58,plain,
! [X0: $i] :
( ~ d(X0)
| ~ c(X0) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_59,plain,
c(a1),
inference(cnf_transformation,[],[f4]) ).
tcf(c_61,negated_conjecture,
! [X0: $i,X1: $i] :
( d(f(X0,X1))
| ~ c(X1)
| ~ c(X0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_62,negated_conjecture,
! [X0: $i,X1: $i] :
( c(f(X0,X1))
| ~ d(X1)
| ~ d(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_69,plain,
! [X0: $i] :
( c(X0)
| d(X0) ),
inference(prop_impl_just,[status(thm)],[c_57]) ).
tcf(c_70,plain,
! [X0: $i] :
( d(X0)
| c(X0) ),
inference(renaming,[status(thm)],[c_69]) ).
tcf(c_84,negated_conjecture,
! [X0: $i,X1: $i] :
( d(X1)
| d(f(X1,X0))
| ~ c(X0) ),
inference(bin_hyper_res,[status(thm)],[c_61,c_70]) ).
tcf(c_136,plain,
! [X0: $i,X1: $i,X2: $i] :
( d(X2)
| d(X0)
| d(f(X2,X1))
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_70,c_84]) ).
tcf(c_137,plain,
! [X0: $i,X1: $i] :
( d(X1)
| d(X0)
| d(f(X0,X1)) ),
inference(unflattening,[status(thm)],[c_136]) ).
tcf(c_201,negated_conjecture,
! [X0: $i,X1: $i] :
( d(X1)
| d(f(X1,X0))
| ~ c(X0) ),
inference(demodulation,[status(thm)],[c_84]) ).
tcf(c_202,negated_conjecture,
! [X0: $i,X1: $i] :
( c(f(X0,X1))
| ~ d(X1)
| ~ d(X0) ),
inference(demodulation,[status(thm)],[c_62]) ).
tcf(c_387,plain,
! [X0: $i,X1: $i] :
( ~ d(X1)
| ~ d(X0)
| ~ d(f(X0,X1)) ),
inference(superposition,[status(thm)],[c_202,c_58]) ).
tcf(c_402,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ d(X2)
| ~ d(f(X0,X1))
| ~ d(f(X0,f(X1,X2))) ),
inference(superposition,[status(thm)],[c_56,c_387]) ).
tcf(c_404,plain,
! [X0: $i,X1: $i,X2: $i] :
( d(f(X1,X2))
| d(f(X1,f(X2,X0)))
| ~ c(X0) ),
inference(superposition,[status(thm)],[c_56,c_201]) ).
tcf(c_423,plain,
! [X0: $i,X1: $i,X2: $i] :
( d(f(X2,X0))
| ~ d(X2)
| ~ c(X1)
| ~ d(f(X0,X1)) ),
inference(superposition,[status(thm)],[c_404,c_387]) ).
tcf(c_458,plain,
! [X0: $i,X1: $i,X2: $i] :
( d(X2)
| ~ d(X1)
| ~ d(f(X2,X0))
| ~ c(f(X0,X1)) ),
inference(superposition,[status(thm)],[c_201,c_402]) ).
tcf(c_482,plain,
! [X0: $i,X1: $i,X2: $i] :
( d(X2)
| d(f(X1,X2))
| ~ d(X1)
| ~ c(X0) ),
inference(superposition,[status(thm)],[c_201,c_423]) ).
tcf(c_504,plain,
! [X0: $i,X1: $i] :
( ~ d(f(X0,X1))
| ~ c(f(X0,X1)) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_514,plain,
! [X0: $i,X1: $i] :
( d(X1)
| d(f(X0,X1))
| ~ d(X0) ),
inference(superposition,[status(thm)],[c_59,c_482]) ).
tcf(c_523,plain,
! [X0: $i,X1: $i] :
( d(X1)
| d(f(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_514,c_137,c_514]) ).
tcf(c_529,plain,
! [X0: $i,X1: $i,X2: $i] :
( d(X2)
| d(f(X0,f(X1,X2))) ),
inference(superposition,[status(thm)],[c_56,c_523]) ).
tcf(c_557,plain,
! [X0: $i,X1: $i,X2: $i] :
( d(X1)
| ~ d(X2)
| ~ d(f(X0,X1)) ),
inference(superposition,[status(thm)],[c_529,c_387]) ).
tcf(c_592,plain,
! [X0: $i,X1: $i,X2: $i] :
( d(X2)
| ~ c(f(X0,X1))
| ~ d(f(X2,X0)) ),
inference(global_subsumption_just,[status(thm)],[c_458,c_458,c_504,c_523]) ).
tcf(c_593,plain,
! [X0: $i,X1: $i,X2: $i] :
( d(X2)
| ~ d(f(X2,X0))
| ~ c(f(X0,X1)) ),
inference(renaming,[status(thm)],[c_592]) ).
tcf(c_600,plain,
! [X0: $i,X1: $i,X2: $i] :
( d(X0)
| ~ d(X2)
| ~ d(X1)
| ~ d(f(X0,X1)) ),
inference(superposition,[status(thm)],[c_202,c_593]) ).
tcf(c_619,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ d(f(X0,X1))
| ~ d(X2) ),
inference(global_subsumption_just,[status(thm)],[c_600,c_62,c_504,c_557,c_600]) ).
tcf(c_620,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ d(X2)
| ~ d(f(X0,X1)) ),
inference(renaming,[status(thm)],[c_619]) ).
tcf(c_631,plain,
! [X0: $i,X1: $i] :
( d(X1)
| ~ d(X0) ),
inference(superposition,[status(thm)],[c_529,c_620]) ).
tcf(c_636,plain,
! [X0: $i,X1: $i] : ~ d(f(X0,X1)),
inference(backward_subsumption_resolution,[status(thm)],[c_620,c_631]) ).
tcf(c_639,plain,
! [X0: $i] : d(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_529,c_636]) ).
tcf(c_643,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_636,c_639]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG011-1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 04:29:09 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.97/1.28 % SZS status Started for theBenchmark.p
% 1.97/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.97/1.28
% 1.97/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.97/1.28
% 1.97/1.28 % ------ iProver source info
% 1.97/1.28
% 1.97/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.97/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.97/1.28 % git: non_committed_changes: false
% 1.97/1.28
% 1.97/1.28 % ------ Parsing...% successful
% 1.97/1.28
% 1.97/1.28
% 1.97/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.97/1.28
% 1.97/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.97/1.28
% 1.97/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.97/1.28
% 1.97/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.97/1.28 % ------ Proving...
% 1.97/1.28 % ------ Problem Properties
% 1.97/1.28
% 1.97/1.28 %
% 1.97/1.28 % clauses 7
% 1.97/1.28 % conjectures 2
% 1.97/1.28 % EPR 4
% 1.97/1.28 % Horn 5
% 1.97/1.28 % unary 3
% 1.97/1.28 % binary 2
% 1.97/1.28 % lits 13
% 1.97/1.28 % lits eq 1
% 1.97/1.28 % fd_pure 0
% 1.97/1.28 % fd_pseudo 0
% 1.97/1.28 % fd_cond 0
% 1.97/1.28 % fd_pseudo_cond 0
% 1.97/1.28 % AC symbols 0
% 1.97/1.28
% 1.97/1.28 % ------ Schedule dynamic 5 is on
% 1.97/1.28
% 1.97/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.97/1.28
% 1.97/1.28
% 1.97/1.28 % ------
% 1.97/1.28 % Current options:
% 1.97/1.28 % ------
% 1.97/1.28
% 1.97/1.28
% 1.97/1.28 %
% 1.97/1.28
% 1.97/1.28 % ------ Proving...
% 1.97/1.28 %
% 1.97/1.28
% 1.97/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.97/1.28
% 1.97/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.97/1.28
% 1.97/1.28
%------------------------------------------------------------------------------