%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP185-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n006.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:31:44 PM UTC 2026
% Result : Unsatisfiable 1.21s 1.78s
% Output : CNFRefutation 1.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 22
% Syntax : Number of formulae : 101 ( 101 unt; 7 def)
% Number of atoms : 221 ( 100 equ)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 109 ( 0 sgn 109 !; 0 ?; 79 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
fof(f4,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
fof(f5,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
fof(f6,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
fof(f7,axiom,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
fof(f8,axiom,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
fof(f11,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
fof(f12,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
fof(f13,axiom,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
fof(f15,axiom,
! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
fof(f16,axiom,
! [X2,X0,X1] : multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
fof(f17,axiom,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p22a_1) ).
fof(f18,plain,
identity = inverse(identity),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
! [X0] : inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p22a_2) ).
fof(f20,axiom,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p22a_3) ).
fof(f21,negated_conjecture,
least_upper_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p22a) ).
fof(f22,plain,
multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)) != least_upper_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))),
inference(reorient_equations,[],[f21]) ).
tcf(c_68,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[],[f6]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(X0,greatest_lower_bound(X1,X2)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(least_upper_bound(X0,X1),X2) = least_upper_bound(X0,least_upper_bound(X1,X2)),
inference(cnf_transformation,[],[f8]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[],[f11]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(cnf_transformation,[],[f12]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,least_upper_bound(X1,X2)),
inference(cnf_transformation,[],[f13]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(least_upper_bound(X0,X2),X1),
inference(cnf_transformation,[],[f15]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(greatest_lower_bound(X0,X2),X1),
inference(cnf_transformation,[],[f16]) ).
tcf(c_83,plain,
inverse(identity) = identity,
inference(cnf_transformation,[],[f18]) ).
tcf(c_84,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(cnf_transformation,[],[f19]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),inverse(X1)) = inverse(multiply(X1,X0)),
inference(cnf_transformation,[],[f20]) ).
tcf(c_86,negated_conjecture,
least_upper_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)),
inference(cnf_transformation,[],[f22]) ).
tcf(c_104,negated_conjecture,
least_upper_bound(identity,least_upper_bound(multiply(a,b),multiply(least_upper_bound(a,identity),least_upper_bound(identity,b)))) != multiply(least_upper_bound(a,identity),least_upper_bound(identity,b)),
inference(theory_normalisation,[status(thm)],[c_86,c_73,c_71,c_74,c_72]) ).
tcf(c_149,definition,
iPr_def_10 = multiply(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_150,definition,
iPr_def_11 = least_upper_bound(a,identity),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_151,definition,
iPr_def_12 = least_upper_bound(identity,b),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_152,definition,
iPr_def_13 = multiply(iPr_def_11,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_153,definition,
iPr_def_14 = least_upper_bound(iPr_def_10,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_154,definition,
iPr_def_15 = least_upper_bound(identity,iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_155,definition,
iPr_def_16 = inverse(identity),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_156,negated_conjecture,
iPr_def_15 != iPr_def_13,
inference(demodulation,[status(thm)],[c_104,c_151,c_150,c_152,c_149,c_153,c_154]) ).
tcf(c_157,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(demodulation,[status(thm)],[c_70]) ).
tcf(c_159,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(demodulation,[status(thm)],[c_68]) ).
tcf(c_160,plain,
! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(greatest_lower_bound(X0,X2),X1),
inference(demodulation,[status(thm)],[c_82]) ).
tcf(c_161,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(least_upper_bound(X0,X2),X1),
inference(demodulation,[status(thm)],[c_81]) ).
tcf(c_163,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,least_upper_bound(X1,X2)),
inference(demodulation,[status(thm)],[c_79]) ).
tcf(c_164,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_78]) ).
tcf(c_165,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_77]) ).
tcf(c_168,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(least_upper_bound(X0,X1),X2) = least_upper_bound(X0,least_upper_bound(X1,X2)),
inference(demodulation,[status(thm)],[c_74]) ).
tcf(c_170,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(demodulation,[status(thm)],[c_72]) ).
tcf(c_171,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(demodulation,[status(thm)],[c_71]) ).
tcf(c_172,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),inverse(X1)) = inverse(multiply(X1,X0)),
inference(demodulation,[status(thm)],[c_85]) ).
tcf(c_173,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_84]) ).
tcf(c_174,plain,
iPr_def_16 = identity,
inference(demodulation,[status(thm)],[c_83,c_155]) ).
tcf(c_272,plain,
inverse(iPr_def_16) = iPr_def_16,
inference(light_normalisation,[status(thm)],[c_155,c_174]) ).
tcf(c_273,plain,
least_upper_bound(a,iPr_def_16) = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_150,c_174]) ).
tcf(c_274,plain,
least_upper_bound(iPr_def_16,b) = iPr_def_12,
inference(light_normalisation,[status(thm)],[c_151,c_174]) ).
tcf(c_275,plain,
least_upper_bound(iPr_def_16,iPr_def_14) = iPr_def_15,
inference(light_normalisation,[status(thm)],[c_154,c_174]) ).
tcf(c_277,plain,
! [X0: $i] : multiply(iPr_def_11,multiply(iPr_def_12,X0)) = multiply(iPr_def_13,X0),
inference(superposition,[status(thm)],[c_152,c_157]) ).
tcf(c_284,plain,
! [X0: $i] : multiply(iPr_def_16,X0) = X0,
inference(light_normalisation,[status(thm)],[c_159,c_174]) ).
tcf(c_298,plain,
least_upper_bound(iPr_def_16,a) = iPr_def_11,
inference(demodulation,[status(thm)],[c_273,c_170]) ).
tcf(c_299,plain,
least_upper_bound(iPr_def_13,iPr_def_10) = iPr_def_14,
inference(demodulation,[status(thm)],[c_153,c_170]) ).
tcf(c_300,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_170,c_164]) ).
tcf(c_306,plain,
! [X0: $i] : multiply(greatest_lower_bound(iPr_def_11,X0),iPr_def_12) = greatest_lower_bound(iPr_def_13,multiply(X0,iPr_def_12)),
inference(superposition,[status(thm)],[c_152,c_160]) ).
tcf(c_332,plain,
! [X0: $i] : multiply(least_upper_bound(a,X0),b) = least_upper_bound(iPr_def_10,multiply(X0,b)),
inference(superposition,[status(thm)],[c_149,c_161]) ).
tcf(c_336,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,multiply(X1,X0)) = multiply(least_upper_bound(iPr_def_16,X1),X0),
inference(superposition,[status(thm)],[c_284,c_161]) ).
tcf(c_341,plain,
! [X0: $i,X1: $i] : least_upper_bound(multiply(X0,X1),X1) = multiply(least_upper_bound(X0,iPr_def_16),X1),
inference(superposition,[status(thm)],[c_284,c_161]) ).
tcf(c_346,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,multiply(X1,X0)) = multiply(least_upper_bound(X1,iPr_def_16),X0),
inference(demodulation,[status(thm)],[c_341,c_170]) ).
tcf(c_390,plain,
! [X0: $i] : multiply(iPr_def_11,least_upper_bound(iPr_def_12,X0)) = least_upper_bound(iPr_def_13,multiply(iPr_def_11,X0)),
inference(superposition,[status(thm)],[c_152,c_163]) ).
tcf(c_412,plain,
greatest_lower_bound(iPr_def_16,iPr_def_11) = iPr_def_16,
inference(superposition,[status(thm)],[c_298,c_164]) ).
tcf(c_413,plain,
greatest_lower_bound(iPr_def_13,iPr_def_14) = iPr_def_13,
inference(superposition,[status(thm)],[c_299,c_164]) ).
tcf(c_421,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_171,c_165]) ).
tcf(c_428,plain,
! [X0: $i] : inverse(multiply(iPr_def_16,X0)) = multiply(inverse(X0),iPr_def_16),
inference(superposition,[status(thm)],[c_272,c_172]) ).
tcf(c_439,plain,
! [X0: $i] : multiply(inverse(X0),iPr_def_16) = inverse(X0),
inference(demodulation,[status(thm)],[c_428,c_284]) ).
tcf(c_466,plain,
! [X0: $i] : least_upper_bound(iPr_def_16,least_upper_bound(b,X0)) = least_upper_bound(iPr_def_12,X0),
inference(superposition,[status(thm)],[c_274,c_168]) ).
tcf(c_469,plain,
! [X0: $i] : least_upper_bound(iPr_def_13,least_upper_bound(iPr_def_10,X0)) = least_upper_bound(iPr_def_14,X0),
inference(superposition,[status(thm)],[c_299,c_168]) ).
tcf(c_796,plain,
greatest_lower_bound(b,iPr_def_12) = b,
inference(superposition,[status(thm)],[c_274,c_300]) ).
tcf(c_807,plain,
greatest_lower_bound(iPr_def_12,b) = b,
inference(demodulation,[status(thm)],[c_796,c_171]) ).
tcf(c_817,plain,
least_upper_bound(iPr_def_12,b) = iPr_def_12,
inference(superposition,[status(thm)],[c_807,c_165]) ).
tcf(c_932,plain,
! [X0: $i] : multiply(X0,iPr_def_16) = X0,
inference(superposition,[status(thm)],[c_173,c_439]) ).
tcf(c_1111,plain,
multiply(greatest_lower_bound(iPr_def_11,iPr_def_16),iPr_def_12) = greatest_lower_bound(iPr_def_13,iPr_def_12),
inference(superposition,[status(thm)],[c_284,c_306]) ).
tcf(c_1118,plain,
greatest_lower_bound(iPr_def_12,iPr_def_13) = iPr_def_12,
inference(demodulation,[status(thm)],[c_1111,c_171,c_284,c_412]) ).
tcf(c_1161,plain,
multiply(iPr_def_11,iPr_def_12) = multiply(iPr_def_13,iPr_def_16),
inference(superposition,[status(thm)],[c_932,c_277]) ).
tcf(c_1164,plain,
multiply(iPr_def_11,iPr_def_12) = iPr_def_13,
inference(demodulation,[status(thm)],[c_1161,c_932]) ).
tcf(c_1190,plain,
least_upper_bound(iPr_def_13,iPr_def_12) = iPr_def_13,
inference(superposition,[status(thm)],[c_1118,c_421]) ).
tcf(c_1193,plain,
least_upper_bound(iPr_def_12,iPr_def_13) = iPr_def_13,
inference(demodulation,[status(thm)],[c_1190,c_170]) ).
tcf(c_1578,plain,
! [X0: $i] : greatest_lower_bound(iPr_def_16,least_upper_bound(iPr_def_12,X0)) = iPr_def_16,
inference(superposition,[status(thm)],[c_466,c_164]) ).
tcf(c_1847,plain,
greatest_lower_bound(iPr_def_16,iPr_def_13) = iPr_def_16,
inference(superposition,[status(thm)],[c_1193,c_1578]) ).
tcf(c_1856,plain,
least_upper_bound(iPr_def_13,iPr_def_16) = iPr_def_13,
inference(superposition,[status(thm)],[c_1847,c_421]) ).
tcf(c_1859,plain,
least_upper_bound(iPr_def_16,iPr_def_13) = iPr_def_13,
inference(demodulation,[status(thm)],[c_1856,c_170]) ).
tcf(c_2197,plain,
! [X0: $i] : least_upper_bound(X0,multiply(a,X0)) = multiply(iPr_def_11,X0),
inference(superposition,[status(thm)],[c_298,c_336]) ).
tcf(c_2744,plain,
least_upper_bound(b,multiply(a,b)) = least_upper_bound(iPr_def_10,multiply(iPr_def_16,b)),
inference(superposition,[status(thm)],[c_346,c_332]) ).
tcf(c_2750,plain,
multiply(iPr_def_11,b) = least_upper_bound(iPr_def_10,b),
inference(demodulation,[status(thm)],[c_2744,c_284,c_2197]) ).
tcf(c_4441,plain,
least_upper_bound(iPr_def_13,multiply(iPr_def_11,b)) = multiply(iPr_def_11,iPr_def_12),
inference(superposition,[status(thm)],[c_817,c_390]) ).
tcf(c_4471,plain,
least_upper_bound(iPr_def_14,b) = iPr_def_13,
inference(demodulation,[status(thm)],[c_4441,c_469,c_1164,c_2750]) ).
tcf(c_5580,plain,
greatest_lower_bound(iPr_def_14,iPr_def_13) = iPr_def_14,
inference(superposition,[status(thm)],[c_4471,c_164]) ).
tcf(c_5590,plain,
iPr_def_13 = iPr_def_14,
inference(demodulation,[status(thm)],[c_5580,c_171,c_413]) ).
tcf(c_5614,plain,
least_upper_bound(iPr_def_16,iPr_def_13) = iPr_def_15,
inference(demodulation,[status(thm)],[c_275,c_5590]) ).
tcf(c_5615,plain,
iPr_def_13 = iPr_def_15,
inference(demodulation,[status(thm)],[c_5614,c_1859]) ).
tcf(c_5625,plain,
iPr_def_13 != iPr_def_13,
inference(demodulation,[status(thm)],[c_156,c_5615]) ).
tcf(c_5626,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_5625]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP185-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.39 % Computer : n006.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8046.5625MB
% 0.14/0.39 % OS : Linux 6.8.0-71-generic
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Wed Sep 23 14:03:12 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.14/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.43 Running UEQ theorem proving
% 0.14/0.43 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.14/0.44
% 0.14/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.44
% 0.14/0.44 % Detected problem language: tptp
% 0.14/0.45 % Proving...
% 1.21/1.78 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.21/1.78 % SZS status Started for theBenchmark.p
% 1.21/1.78 % SZS status Unsatisfiable for theBenchmark.p
% 1.21/1.78
% 1.21/1.78 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.21/1.78
% 1.21/1.78 % ------ iProver source info
% 1.21/1.78
% 1.21/1.78 % git: date: 2026-07-19 20:42:38 +0200
% 1.21/1.78 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.21/1.78 % git: non_committed_changes: false
% 1.21/1.78
% 1.21/1.78 % ------ Parsing...% successful
% 1.21/1.78
% 1.21/1.78
% 1.21/1.78 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.21/1.78
% 1.21/1.78 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.21/1.78
% 1.21/1.78 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.21/1.78
% 1.21/1.78 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.21/1.78 % ------ Proving...
% 1.21/1.78 % ------ Problem Properties
% 1.21/1.78
% 1.21/1.78 %
% 1.21/1.78 % clauses 26
% 1.21/1.78 % conjectures 1
% 1.21/1.78 % EPR 2
% 1.21/1.78 % Horn 26
% 1.21/1.78 % unary 26
% 1.21/1.78 % binary 0
% 1.21/1.78 % lits 26
% 1.21/1.78 % lits eq 26
% 1.21/1.78 % fd_pure 0
% 1.21/1.78 % fd_pseudo 0
% 1.21/1.78 % fd_cond 0
% 1.21/1.78 % fd_pseudo_cond 0
% 1.21/1.78 % AC symbols 2
% 1.21/1.78
% 1.21/1.78 % ------ Input Options Time Limit: Unbounded
% 1.21/1.78
% 1.21/1.78
% 1.21/1.78 % ------
% 1.21/1.78 % Current options:
% 1.21/1.78 % ------
% 1.21/1.78
% 1.21/1.78
% 1.21/1.78 %
% 1.21/1.78
% 1.21/1.78 % ------ Proving...
% 1.21/1.78 %
% 1.21/1.78
% 1.21/1.78 % SZS status Unsatisfiable for theBenchmark.p
% 1.21/1.78
% 1.21/1.78 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.21/1.78
% 1.21/1.78
%------------------------------------------------------------------------------