%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GEO056-2 : 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 : n003.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:19:43 PM UTC 2026
% Result : Unsatisfiable 1.80s 6.28s
% Output : CNFRefutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 15 ( 13 unt; 1 def)
% Number of atoms : 22 ( 12 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 7 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-4 aty)
% Number of variables : 19 ( 0 sgn 19 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X2,X0,X1] :
( X0 = X1
| ~ equidistant(X0,X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',identity_for_equidistance) ).
fof(f5,axiom,
! [X2,X3,X0,X1] : equidistant(X0,extension(X1,X0,X2,X3),X2,X3),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',segment_construction2) ).
fof(f19,axiom,
! [X0,X1] : reflection(X0,X1) = extension(X0,X1,X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-2.ax',reflection) ).
fof(f20,axiom,
u = v,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_equals_v) ).
fof(f21,negated_conjecture,
v != reflection(u,v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_v_equals_reflection) ).
fof(f22,plain,
v != extension(v,v,v,v),
inference(definition_unfolding,[],[f21,f19,f20]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X1 )
| ~ equidistant(X0,X1,X2,X2) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : equidistant(X0,extension(X1,X0,X2,X3),X2,X3),
inference(cnf_transformation,[],[f5]) ).
tcf(c_88,negated_conjecture,
extension(v,v,v,v) != v,
inference(cnf_transformation,[],[f22]) ).
tcf(c_316,definition,
iPr_def_10 = extension(v,v,v,v),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_317,negated_conjecture,
iPr_def_10 != v,
inference(demodulation,[status(thm)],[c_88,c_316]) ).
tcf(c_642,plain,
! [X0: $i,X1: $i,X2: $i] : extension(X0,X1,X2,X2) = X1,
inference(superposition,[status(thm)],[c_74,c_72]) ).
tcf(c_643,plain,
v = iPr_def_10,
inference(demodulation,[status(thm)],[c_316,c_642]) ).
tcf(c_645,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_317,c_643]) ).
tcf(c_646,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_645]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO056-2 : 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/5.37 % Computer : n003.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Wed Sep 23 10:39:10 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.41 Running first-order theorem proving
% 0.15/5.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.15/5.42
% 0.15/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.42
% 0.15/5.42 % Detected problem language: tptp
% 0.15/5.43 % Proving...
% 1.80/6.28 % SZS status Started for theBenchmark.p
% 1.80/6.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.80/6.28
% 1.80/6.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.80/6.28
% 1.80/6.28 % ------ iProver source info
% 1.80/6.28
% 1.80/6.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.80/6.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.80/6.28 % git: non_committed_changes: false
% 1.80/6.28
% 1.80/6.28 % ------ Parsing...% successful
% 1.80/6.28
% 1.80/6.28
% 1.80/6.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.80/6.28
% 1.80/6.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.80/6.28
% 1.80/6.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.80/6.28
% 1.80/6.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.80/6.28 % ------ Proving...
% 1.80/6.28 % ------ Problem Properties
% 1.80/6.28
% 1.80/6.28 %
% 1.80/6.28 % clauses 20
% 1.80/6.28 % conjectures 1
% 1.80/6.28 % EPR 10
% 1.80/6.28 % Horn 15
% 1.80/6.28 % unary 8
% 1.80/6.28 % binary 2
% 1.80/6.28 % lits 58
% 1.80/6.28 % lits eq 9
% 1.80/6.28 % fd_pure 0
% 1.80/6.28 % fd_pseudo 0
% 1.80/6.28 % fd_cond 0
% 1.80/6.28 % fd_pseudo_cond 7
% 1.80/6.28 % AC symbols 0
% 1.80/6.28
% 1.80/6.28 % ------ Schedule dynamic 5 is on
% 1.80/6.28
% 1.80/6.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.80/6.28
% 1.80/6.28
% 1.80/6.28 % ------
% 1.80/6.28 % Current options:
% 1.80/6.28 % ------
% 1.80/6.28
% 1.80/6.28
% 1.80/6.28 %
% 1.80/6.28
% 1.80/6.28 % ------ Proving...
% 1.80/6.28 %
% 1.80/6.28
% 1.80/6.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.80/6.28
% 1.80/6.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.80/6.28
% 1.80/6.28
%------------------------------------------------------------------------------