%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : REL014+1 : TPTP v9.3.1. Released v4.0.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 02:36:36 PM UTC 2026
% Result : Theorem 0.98s 1.29s
% Output : CNFRefutation 0.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 21 unt; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 9 ~; 4 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 31 !; 1 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1,X2] : composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_associativity) ).
fof(f6,axiom,
! [X0] : composition(X0,one) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(f8,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(f10,axiom,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(f14,conjecture,
! [X0] :
( composition(one,X0) = X0
& composition(X0,one) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0] :
( composition(one,X0) = X0
& composition(X0,one) = X0 ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
? [X0] :
( composition(one,X0) != X0
| composition(X0,one) != X0 ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
( sK0 != composition(one,sK0)
| sK0 != composition(sK0,one) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f16]) ).
fof(f22,plain,
! [X2,X0,X1] : composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f23,plain,
! [X0] : composition(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f25,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
fof(f27,plain,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f31,plain,
( sK0 != composition(one,sK0)
| sK0 != composition(sK0,one) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] : composition(composition(X0,X1),X2) = composition(X0,composition(X1,X2)),
inference(cnf_transformation,[],[f22]) ).
tcf(c_53,plain,
! [X0: $i] : composition(X0,one) = X0,
inference(cnf_transformation,[],[f23]) ).
tcf(c_55,plain,
! [X0: $i] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f25]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : composition(converse(X0),converse(X1)) = converse(composition(X1,X0)),
inference(cnf_transformation,[],[f27]) ).
tcf(c_61,negated_conjecture,
( ( composition(sK0,one) != sK0 )
| ( composition(one,sK0) != sK0 ) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_63,plain,
composition(sK0,one) = sK0,
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_194,plain,
! [X0: $i,X1: $i] : converse(composition(converse(X0),X1)) = composition(converse(X1),X0),
inference(superposition,[status(thm)],[c_55,c_57]) ).
tcf(c_203,plain,
! [X0: $i,X1: $i] : composition(X0,composition(one,X1)) = composition(X0,X1),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_385,plain,
! [X0: $i] : composition(converse(one),X0) = converse(converse(X0)),
inference(superposition,[status(thm)],[c_53,c_194]) ).
tcf(c_407,plain,
! [X0: $i] : composition(converse(one),X0) = X0,
inference(light_normalisation,[status(thm)],[c_385,c_55]) ).
tcf(c_427,plain,
! [X0: $i] : composition(converse(one),X0) = composition(one,X0),
inference(superposition,[status(thm)],[c_407,c_203]) ).
tcf(c_430,plain,
! [X0: $i] : composition(one,X0) = X0,
inference(light_normalisation,[status(thm)],[c_427,c_407]) ).
tcf(c_452,plain,
composition(one,sK0) = sK0,
inference(instantiation,[status(thm)],[c_430]) ).
tcf(c_453,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_452,c_61,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL014+1 : TPTP v9.3.1. Released v4.0.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 : Thu Sep 24 07:10:52 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...
% 0.98/1.29 % SZS status Started for theBenchmark.p
% 0.98/1.29 % SZS status Theorem for theBenchmark.p
% 0.98/1.29
% 0.98/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.98/1.29
% 0.98/1.29 % ------ iProver source info
% 0.98/1.29
% 0.98/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.98/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.98/1.29 % git: non_committed_changes: false
% 0.98/1.29
% 0.98/1.29 % ------ Parsing...
% 0.98/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.98/1.29
% 0.98/1.29 % ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.98/1.29
% 0.98/1.29 % ------ Preprocessing...% ------ preprocesses with Option_UEQ
% 0.98/1.29 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.98/1.29
% 0.98/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.98/1.29 % ------ Proving...
% 0.98/1.29 % ------ Problem Properties
% 0.98/1.29
% 0.98/1.29 %
% 0.98/1.29 % clauses 14
% 0.98/1.29 % conjectures 1
% 0.98/1.29 % EPR 1
% 0.98/1.29 % Horn 14
% 0.98/1.29 % unary 14
% 0.98/1.29 % binary 0
% 0.98/1.29 % lits 14
% 0.98/1.29 % lits eq 14
% 0.98/1.29 % fd_pure 0
% 0.98/1.29 % fd_pseudo 0
% 0.98/1.29 % fd_cond 0
% 0.98/1.29 % fd_pseudo_cond 0
% 0.98/1.29 % AC symbols 1
% 0.98/1.29
% 0.98/1.29 % ------ Schedule UEQ
% 0.98/1.29
% 0.98/1.29 % ------ Option_UEQ Time Limit: 10.
% 0.98/1.29
% 0.98/1.29
% 0.98/1.29 % ------
% 0.98/1.29 % Current options:
% 0.98/1.29 % ------
% 0.98/1.29
% 0.98/1.29
% 0.98/1.29 %
% 0.98/1.29
% 0.98/1.29 % ------ Proving...
% 0.98/1.29 %
% 0.98/1.29
% 0.98/1.29 % SZS status Theorem for theBenchmark.p
% 0.98/1.29
% 0.98/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.98/1.29
% 0.98/1.29
%------------------------------------------------------------------------------