%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN349-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n002.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:48 PM UTC 2026
% Result : Unsatisfiable 1.78s 6.50s
% Output : CNFRefutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 1 unt; 0 def)
% Number of atoms : 141 ( 0 equ)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 108 ( 46 ~; 62 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 3 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 42 ( 0 sgn 42 !; 0 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X0,X1] :
( ~ f(w(X0),g(X0,X1))
| f(X0,g(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).
fof(f2,negated_conjecture,
! [X0,X1] :
( f(w(X0),g(X0,X1))
| ~ f(X0,g(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).
fof(f3,negated_conjecture,
! [X0,X1] :
( f(g(X0,X1),w(X0))
| ~ f(X1,g(X0,X1))
| f(g(X0,X1),X1)
| ~ f(X0,g(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).
fof(f5,negated_conjecture,
! [X0,X1] :
( f(g(X0,X1),w(X0))
| f(X1,g(X0,X1))
| f(g(X0,X1),X1)
| f(X0,g(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).
fof(f8,negated_conjecture,
! [X0,X1] :
( ~ f(g(X0,X1),w(X0))
| f(X1,g(X0,X1))
| ~ f(g(X0,X1),X1)
| f(X0,g(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
fof(f10,negated_conjecture,
! [X0,X1] :
( ~ f(g(X0,X1),w(X0))
| ~ f(X1,g(X0,X1))
| ~ f(g(X0,X1),X1)
| ~ f(X0,g(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause10) ).
tcf(c_59,negated_conjecture,
! [X0: $i,X1: $i] :
( f(X0,g(X0,X1))
| ~ f(w(X0),g(X0,X1)) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_60,negated_conjecture,
! [X0: $i,X1: $i] :
( f(w(X0),g(X0,X1))
| ~ f(X0,g(X0,X1)) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_61,negated_conjecture,
! [X0: $i,X1: $i] :
( f(g(X0,X1),X1)
| f(g(X0,X1),w(X0))
| ~ f(X1,g(X0,X1))
| ~ f(X0,g(X0,X1)) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_63,negated_conjecture,
! [X0: $i,X1: $i] :
( f(X1,g(X0,X1))
| f(X0,g(X0,X1))
| f(g(X0,X1),X1)
| f(g(X0,X1),w(X0)) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_66,negated_conjecture,
! [X0: $i,X1: $i] :
( f(X1,g(X0,X1))
| f(X0,g(X0,X1))
| ~ f(g(X0,X1),X1)
| ~ f(g(X0,X1),w(X0)) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_68,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ f(X1,g(X0,X1))
| ~ f(X0,g(X0,X1))
| ~ f(g(X0,X1),X1)
| ~ f(g(X0,X1),w(X0)) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_163,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ f(X1,g(X0,X1))
| ~ f(X0,g(X0,X1))
| ~ f(g(X0,X1),X1)
| ~ f(g(X0,X1),w(X0)) ),
inference(demodulation,[status(thm)],[c_68]) ).
tcf(c_165,negated_conjecture,
! [X0: $i,X1: $i] :
( f(X1,g(X0,X1))
| f(X0,g(X0,X1))
| ~ f(g(X0,X1),X1)
| ~ f(g(X0,X1),w(X0)) ),
inference(demodulation,[status(thm)],[c_66]) ).
tcf(c_168,negated_conjecture,
! [X0: $i,X1: $i] :
( f(X1,g(X0,X1))
| f(X0,g(X0,X1))
| f(g(X0,X1),X1)
| f(g(X0,X1),w(X0)) ),
inference(demodulation,[status(thm)],[c_63]) ).
tcf(c_170,negated_conjecture,
! [X0: $i,X1: $i] :
( f(g(X0,X1),X1)
| f(g(X0,X1),w(X0))
| ~ f(X1,g(X0,X1))
| ~ f(X0,g(X0,X1)) ),
inference(demodulation,[status(thm)],[c_61]) ).
tcf(c_171,negated_conjecture,
! [X0: $i,X1: $i] :
( f(w(X0),g(X0,X1))
| ~ f(X0,g(X0,X1)) ),
inference(demodulation,[status(thm)],[c_60]) ).
tcf(c_172,negated_conjecture,
! [X0: $i,X1: $i] :
( f(X0,g(X0,X1))
| ~ f(w(X0),g(X0,X1)) ),
inference(demodulation,[status(thm)],[c_59]) ).
tcf(c_173,plain,
! [X0: $i] :
( f(g(X0,w(X0)),w(X0))
| ~ f(X0,g(X0,w(X0)))
| ~ f(w(X0),g(X0,w(X0))) ),
inference(instantiation,[status(thm)],[c_170]) ).
tcf(c_174,plain,
! [X0: $i] :
( ~ f(X0,g(X0,w(X0)))
| ~ f(w(X0),g(X0,w(X0)))
| ~ f(g(X0,w(X0)),w(X0)) ),
inference(instantiation,[status(thm)],[c_163]) ).
tcf(c_175,plain,
( f(g(iProver_bot,w(iProver_bot)),w(iProver_bot))
| ~ f(iProver_bot,g(iProver_bot,w(iProver_bot)))
| ~ f(w(iProver_bot),g(iProver_bot,w(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_173]) ).
tcf(c_176,plain,
( ~ f(iProver_bot,g(iProver_bot,w(iProver_bot)))
| ~ f(w(iProver_bot),g(iProver_bot,w(iProver_bot)))
| ~ f(g(iProver_bot,w(iProver_bot)),w(iProver_bot)) ),
inference(instantiation,[status(thm)],[c_174]) ).
tcf(c_179,plain,
! [X0: $i] :
( f(X0,g(X0,w(X0)))
| f(w(X0),g(X0,w(X0)))
| f(g(X0,w(X0)),w(X0)) ),
inference(instantiation,[status(thm)],[c_168]) ).
tcf(c_180,plain,
! [X0: $i] :
( f(X0,g(X0,w(X0)))
| f(w(X0),g(X0,w(X0)))
| ~ f(g(X0,w(X0)),w(X0)) ),
inference(instantiation,[status(thm)],[c_165]) ).
tcf(c_182,plain,
! [X0: $i] :
( f(X0,g(X0,w(X0)))
| ~ f(w(X0),g(X0,w(X0))) ),
inference(instantiation,[status(thm)],[c_172]) ).
tcf(c_183,plain,
( f(iProver_bot,g(iProver_bot,w(iProver_bot)))
| ~ f(w(iProver_bot),g(iProver_bot,w(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_182]) ).
tcf(c_184,plain,
( f(iProver_bot,g(iProver_bot,w(iProver_bot)))
| f(w(iProver_bot),g(iProver_bot,w(iProver_bot)))
| ~ f(g(iProver_bot,w(iProver_bot)),w(iProver_bot)) ),
inference(instantiation,[status(thm)],[c_180]) ).
tcf(c_185,plain,
( f(iProver_bot,g(iProver_bot,w(iProver_bot)))
| f(w(iProver_bot),g(iProver_bot,w(iProver_bot)))
| f(g(iProver_bot,w(iProver_bot)),w(iProver_bot)) ),
inference(instantiation,[status(thm)],[c_179]) ).
tcf(c_186,plain,
! [X0: $i] :
( f(w(X0),g(X0,w(X0)))
| ~ f(X0,g(X0,w(X0))) ),
inference(instantiation,[status(thm)],[c_171]) ).
tcf(c_187,plain,
( f(w(iProver_bot),g(iProver_bot,w(iProver_bot)))
| ~ f(iProver_bot,g(iProver_bot,w(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_186]) ).
tcf(c_190,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_187,c_185,c_184,c_183,c_176,c_175]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN349-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/5.58 % Computer : n002.cluster.edu
% 0.08/5.58 % Model : x86_64 x86_64
% 0.08/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.58 % Memory : 8046.5625MB
% 0.08/5.58 % OS : Linux 6.8.0-71-generic
% 0.08/5.58 % CPULimit : 300
% 0.08/5.58 % WCLimit : 300
% 0.08/5.58 % DateTime : Fri Sep 25 00:59:11 UTC 2026
% 0.08/5.58 % CPUTime :
% 0.08/5.58 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/5.62 Running first-order theorem proving
% 0.13/5.62 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/5.63
% 0.13/5.63 % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.63
% 0.13/5.63 % Detected problem language: tptp
% 0.13/5.65 % Proving...
% 1.78/6.50 % SZS status Started for theBenchmark.p
% 1.78/6.50 % SZS status Unsatisfiable for theBenchmark.p
% 1.78/6.50
% 1.78/6.50 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.78/6.50
% 1.78/6.50 % ------ iProver source info
% 1.78/6.50
% 1.78/6.50 % git: date: 2026-07-19 20:42:38 +0200
% 1.78/6.50 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.78/6.50 % git: non_committed_changes: false
% 1.78/6.50
% 1.78/6.50 % ------ Parsing...% successful
% 1.78/6.50
% 1.78/6.50
% 1.78/6.50 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.78/6.50
% 1.78/6.50 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.78/6.50
% 1.78/6.50 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.78/6.50 % ------ Proving...
% 1.78/6.50 % ------ Problem Properties
% 1.78/6.50
% 1.78/6.50 %
% 1.78/6.50 % clauses 10
% 1.78/6.50 % conjectures 10
% 1.78/6.50 % EPR 0
% 1.78/6.50 % Horn 3
% 1.78/6.50 % unary 0
% 1.78/6.50 % binary 2
% 1.78/6.50 % lits 36
% 1.78/6.50 % lits eq 0
% 1.78/6.50 % fd_pure 0
% 1.78/6.50 % fd_pseudo 0
% 1.78/6.50 % fd_cond 0
% 1.78/6.50 % fd_pseudo_cond 0
% 1.78/6.50 % AC symbols 0
% 1.78/6.50
% 1.78/6.50 % ------ Schedule dynamic 5 is on
% 1.78/6.50
% 1.78/6.50 % ------ no equalities: superposition off
% 1.78/6.50
% 1.78/6.50 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.78/6.50
% 1.78/6.50
% 1.78/6.50 % ------
% 1.78/6.50 % Current options:
% 1.78/6.50 % ------
% 1.78/6.50
% 1.78/6.50
% 1.78/6.50 %
% 1.78/6.50
% 1.78/6.50 % ------ Proving...
% 1.78/6.50 %
% 1.78/6.50
% 1.78/6.50 % SZS status Unsatisfiable for theBenchmark.p
% 1.78/6.50
% 1.78/6.50 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.78/6.50
% 1.78/6.50
%------------------------------------------------------------------------------