%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COL036-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n008.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:02:36 PM UTC 2026
% Result : Unsatisfiable 149.62s 21.37s
% Output : CNFRefutation 149.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 8 ( 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 42 !; 0 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : apply(apply(apply(s,X0),X1),X2) = apply(apply(X0,X2),apply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_definition) ).
fof(f2,axiom,
! [X2,X0,X1] : apply(apply(apply(b,X0),X1),X2) = apply(X0,apply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition) ).
fof(f3,axiom,
! [X0,X1] : apply(apply(t,X0),X1) = apply(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t_definition) ).
fof(f4,negated_conjecture,
! [X0] : apply(X0,f(X0)) != apply(f(X0),apply(X0,f(X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_fixed_point) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : apply(apply(X0,X1),apply(X2,X1)) = apply(apply(apply(s,X0),X2),X1),
inference(cnf_transformation,[],[f1]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] : apply(apply(apply(b,X0),X1),X2) = apply(X0,apply(X1,X2)),
inference(cnf_transformation,[],[f2]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] : apply(apply(t,X0),X1) = apply(X1,X0),
inference(cnf_transformation,[],[f3]) ).
tcf(c_56,negated_conjecture,
! [X0: $i] : apply(f(X0),apply(X0,f(X0))) != apply(X0,f(X0)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_72,negated_conjecture,
! [X0: $i] : apply(f(X0),apply(X0,f(X0))) != apply(X0,f(X0)),
inference(demodulation,[status(thm)],[c_56]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] : apply(apply(t,X0),X1) = apply(X1,X0),
inference(demodulation,[status(thm)],[c_55]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i,X2: $i] : apply(apply(apply(b,X0),X1),X2) = apply(X0,apply(X1,X2)),
inference(demodulation,[status(thm)],[c_54]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i] : apply(apply(X0,X1),apply(X2,X1)) = apply(apply(apply(s,X0),X2),X1),
inference(demodulation,[status(thm)],[c_53]) ).
tcf(c_105,plain,
! [X0: $i,X1: $i] : apply(f(apply(apply(b,X0),X1)),apply(X0,apply(X1,f(apply(apply(b,X0),X1))))) != apply(X0,apply(X1,f(apply(apply(b,X0),X1)))),
inference(superposition,[status(thm)],[c_74,c_72]) ).
tcf(c_108,plain,
! [X0: $i,X1: $i] : apply(f(apply(apply(b,apply(t,X0)),X1)),apply(apply(X1,f(apply(apply(b,apply(t,X0)),X1))),X0)) != apply(apply(X1,f(apply(apply(b,apply(t,X0)),X1))),X0),
inference(superposition,[status(thm)],[c_73,c_105]) ).
tcf(c_1166,plain,
! [X0: $i,X1: $i,X2: $i] : apply(apply(apply(apply(s,b),X0),X1),X2) = apply(X1,apply(apply(X0,X1),X2)),
inference(superposition,[status(thm)],[c_75,c_74]) ).
tcf(c_1168,plain,
! [X0: $i,X1: $i] : apply(apply(apply(s,t),X0),X1) = apply(apply(X0,X1),X1),
inference(superposition,[status(thm)],[c_75,c_73]) ).
tcf(c_1474,plain,
! [X0: $i,X1: $i] : apply(apply(apply(apply(s,b),X0),f(apply(apply(b,apply(t,X1)),X0))),X1) != apply(apply(X0,f(apply(apply(b,apply(t,X1)),X0))),X1),
inference(demodulation,[status(thm)],[c_108,c_1166]) ).
tcf(c_1878,plain,
! [X0: $i,X1: $i] : apply(apply(apply(s,t),apply(b,X0)),X1) = apply(X0,apply(X1,X1)),
inference(superposition,[status(thm)],[c_1168,c_74]) ).
tcf(c_9740,plain,
! [X0: $i,X1: $i] : apply(apply(apply(apply(apply(s,t),apply(b,apply(s,b))),X0),f(apply(apply(b,apply(t,X1)),apply(X0,X0)))),X1) != apply(apply(apply(X0,X0),f(apply(apply(b,apply(t,X1)),apply(X0,X0)))),X1),
inference(superposition,[status(thm)],[c_1878,c_1474]) ).
tcf(c_16609,plain,
$false,
inference(equality_resolution,[status(thm)],[c_9740]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COL036-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n008.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 07:16:10 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 UEQ theorem proving
% 0.10/0.41 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.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...
% 149.62/21.37 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 149.62/21.37 % SZS status Started for theBenchmark.p
% 149.62/21.37 % SZS status Unsatisfiable for theBenchmark.p
% 149.62/21.37
% 149.62/21.37 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 149.62/21.37
% 149.62/21.37 % ------ iProver source info
% 149.62/21.37
% 149.62/21.37 % git: date: 2026-07-19 20:42:38 +0200
% 149.62/21.37 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 149.62/21.37 % git: non_committed_changes: false
% 149.62/21.37
% 149.62/21.37 % ------ Parsing...% successful
% 149.62/21.37
% 149.62/21.37
% 149.62/21.37 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 149.62/21.37
% 149.62/21.37 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 149.62/21.37
% 149.62/21.37 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 149.62/21.37
% 149.62/21.37 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 149.62/21.37 % ------ Proving...
% 149.62/21.37 % ------ Problem Properties
% 149.62/21.37
% 149.62/21.37 %
% 149.62/21.37 % clauses 4
% 149.62/21.37 % conjectures 1
% 149.62/21.37 % EPR 0
% 149.62/21.37 % Horn 4
% 149.62/21.37 % unary 4
% 149.62/21.37 % binary 0
% 149.62/21.37 % lits 4
% 149.62/21.37 % lits eq 4
% 149.62/21.37 % fd_pure 0
% 149.62/21.37 % fd_pseudo 0
% 149.62/21.37 % fd_cond 0
% 149.62/21.37 % fd_pseudo_cond 0
% 149.62/21.37 % AC symbols 0
% 149.62/21.37
% 149.62/21.37 % ------ Input Options Time Limit: Unbounded
% 149.62/21.37
% 149.62/21.37
% 149.62/21.37 % ------
% 149.62/21.37 % Current options:
% 149.62/21.37 % ------
% 149.62/21.37
% 149.62/21.37
% 149.62/21.37 %
% 149.62/21.37
% 149.62/21.37 % ------ Proving...
% 149.62/21.37 %
% 149.62/21.37
% 149.62/21.37 % SZS status Unsatisfiable for theBenchmark.p
% 149.62/21.37
% 149.62/21.37 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 149.62/21.37
% 149.62/21.37
%------------------------------------------------------------------------------