%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LAT012-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n020.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:58:06 PM UTC 2026
% Result : Unsatisfiable 2.21s 1.16s
% Output : CNFRefutation 2.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 43 unt; 2 def)
% Number of atoms : 87 ( 42 equ)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn 54 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : join(X0,meet(X1,meet(X0,X2))) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mckenzie1) ).
fof(f2,axiom,
! [X2,X0,X1] : meet(X0,join(X1,join(X0,X2))) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mckenzie2) ).
fof(f3,axiom,
! [X2,X0,X1] : join(join(meet(X0,X1),meet(X1,X2)),X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mckenzie3) ).
fof(f4,axiom,
! [X2,X0,X1] : meet(meet(join(X0,X1),join(X1,X2)),X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mckenzie4) ).
fof(f5,negated_conjecture,
meet(b,a) != meet(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_commutativity_of_meet) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] : join(X0,meet(X1,meet(X0,X2))) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] : meet(X0,join(X1,join(X0,X2))) = X0,
inference(cnf_transformation,[],[f2]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] : join(join(meet(X0,X1),meet(X1,X2)),X1) = X1,
inference(cnf_transformation,[],[f3]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] : meet(meet(join(X0,X1),join(X1,X2)),X1) = X1,
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,negated_conjecture,
meet(b,a) != meet(a,b),
inference(cnf_transformation,[],[f5]) ).
tcf(c_77,definition,
iPr_def_10 = meet(b,a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_78,definition,
iPr_def_11 = meet(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_79,negated_conjecture,
iPr_def_10 != iPr_def_11,
inference(demodulation,[status(thm)],[c_58,c_78,c_77]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i,X2: $i] : meet(meet(join(X0,X1),join(X1,X2)),X1) = X1,
inference(demodulation,[status(thm)],[c_57]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i,X2: $i] : join(join(meet(X0,X1),meet(X1,X2)),X1) = X1,
inference(demodulation,[status(thm)],[c_56]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i,X2: $i] : meet(X0,join(X1,join(X0,X2))) = X0,
inference(demodulation,[status(thm)],[c_55]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i,X2: $i] : join(X0,meet(X1,meet(X0,X2))) = X0,
inference(demodulation,[status(thm)],[c_54]) ).
tcf(c_125,plain,
! [X0: $i,X1: $i] : join(X0,meet(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_82,c_83]) ).
tcf(c_126,plain,
! [X0: $i] : join(b,meet(X0,iPr_def_10)) = b,
inference(superposition,[status(thm)],[c_77,c_83]) ).
tcf(c_127,plain,
! [X0: $i] : join(a,meet(X0,iPr_def_11)) = a,
inference(superposition,[status(thm)],[c_78,c_83]) ).
tcf(c_128,plain,
! [X0: $i,X1: $i] : meet(X0,join(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_83,c_82]) ).
tcf(c_133,plain,
! [X0: $i,X1: $i] : join(X0,meet(X0,X1)) = X0,
inference(superposition,[status(thm)],[c_80,c_83]) ).
tcf(c_134,plain,
! [X0: $i,X1: $i] : join(meet(X0,X1),X1) = X1,
inference(superposition,[status(thm)],[c_83,c_81]) ).
tcf(c_141,plain,
! [X0: $i] : join(join(meet(X0,b),iPr_def_10),b) = b,
inference(superposition,[status(thm)],[c_77,c_81]) ).
tcf(c_142,plain,
! [X0: $i] : join(join(meet(X0,a),iPr_def_11),a) = a,
inference(superposition,[status(thm)],[c_78,c_81]) ).
tcf(c_201,plain,
join(a,iPr_def_10) = a,
inference(superposition,[status(thm)],[c_77,c_125]) ).
tcf(c_202,plain,
join(b,iPr_def_11) = b,
inference(superposition,[status(thm)],[c_78,c_125]) ).
tcf(c_228,plain,
! [X0: $i] : meet(meet(X0,iPr_def_10),b) = meet(X0,iPr_def_10),
inference(superposition,[status(thm)],[c_126,c_128]) ).
tcf(c_229,plain,
! [X0: $i] : meet(meet(X0,iPr_def_11),a) = meet(X0,iPr_def_11),
inference(superposition,[status(thm)],[c_127,c_128]) ).
tcf(c_858,plain,
! [X0: $i] : meet(meet(a,join(iPr_def_10,X0)),iPr_def_10) = iPr_def_10,
inference(superposition,[status(thm)],[c_201,c_80]) ).
tcf(c_867,plain,
! [X0: $i] : meet(meet(b,join(iPr_def_11,X0)),iPr_def_11) = iPr_def_11,
inference(superposition,[status(thm)],[c_202,c_80]) ).
tcf(c_939,plain,
! [X0: $i] : join(join(meet(X0,iPr_def_10),iPr_def_10),b) = b,
inference(superposition,[status(thm)],[c_228,c_141]) ).
tcf(c_953,plain,
! [X0: $i] : join(join(meet(X0,iPr_def_11),iPr_def_11),a) = a,
inference(superposition,[status(thm)],[c_229,c_142]) ).
tcf(c_1114,plain,
join(iPr_def_11,a) = a,
inference(demodulation,[status(thm)],[c_953,c_134]) ).
tcf(c_1115,plain,
join(iPr_def_10,b) = b,
inference(demodulation,[status(thm)],[c_939,c_134]) ).
tcf(c_1403,plain,
meet(meet(a,b),iPr_def_10) = iPr_def_10,
inference(superposition,[status(thm)],[c_1115,c_858]) ).
tcf(c_1492,plain,
meet(iPr_def_11,iPr_def_10) = iPr_def_10,
inference(demodulation,[status(thm)],[c_1403,c_78]) ).
tcf(c_1593,plain,
meet(meet(b,a),iPr_def_11) = iPr_def_11,
inference(superposition,[status(thm)],[c_1114,c_867]) ).
tcf(c_1641,plain,
join(iPr_def_11,iPr_def_10) = iPr_def_11,
inference(superposition,[status(thm)],[c_1492,c_133]) ).
tcf(c_1879,plain,
meet(iPr_def_10,iPr_def_11) = iPr_def_11,
inference(demodulation,[status(thm)],[c_1593,c_77]) ).
tcf(c_1957,plain,
meet(iPr_def_10,iPr_def_11) = iPr_def_10,
inference(superposition,[status(thm)],[c_1641,c_128]) ).
tcf(c_2249,plain,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_1957,c_1879]) ).
tcf(c_2250,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2249,c_79]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT012-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n020.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Wed Sep 23 20:01:33 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running UEQ theorem proving
% 0.12/0.39 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 2.21/1.16 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.21/1.16 % SZS status Started for theBenchmark.p
% 2.21/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 2.21/1.16
% 2.21/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.21/1.16
% 2.21/1.16 % ------ iProver source info
% 2.21/1.16
% 2.21/1.16 % git: date: 2026-07-19 20:42:38 +0200
% 2.21/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.21/1.16 % git: non_committed_changes: false
% 2.21/1.16
% 2.21/1.16 % ------ Parsing...% successful
% 2.21/1.16
% 2.21/1.16
% 2.21/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.21/1.16
% 2.21/1.16 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.21/1.16
% 2.21/1.16 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.21/1.16
% 2.21/1.16 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.21/1.16 % ------ Proving...
% 2.21/1.16 % ------ Problem Properties
% 2.21/1.16
% 2.21/1.16 %
% 2.21/1.16 % clauses 7
% 2.21/1.16 % conjectures 1
% 2.21/1.16 % EPR 1
% 2.21/1.16 % Horn 7
% 2.21/1.16 % unary 7
% 2.21/1.16 % binary 0
% 2.21/1.16 % lits 7
% 2.21/1.16 % lits eq 7
% 2.21/1.16 % fd_pure 0
% 2.21/1.16 % fd_pseudo 0
% 2.21/1.16 % fd_cond 0
% 2.21/1.16 % fd_pseudo_cond 0
% 2.21/1.16 % AC symbols 0
% 2.21/1.16
% 2.21/1.16 % ------ Input Options Time Limit: Unbounded
% 2.21/1.16
% 2.21/1.16
% 2.21/1.16 % ------
% 2.21/1.16 % Current options:
% 2.21/1.16 % ------
% 2.21/1.16
% 2.21/1.16
% 2.21/1.16 %
% 2.21/1.16
% 2.21/1.16 % ------ Proving...
% 2.21/1.16 %
% 2.21/1.16
% 2.21/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 2.21/1.16
% 2.21/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.21/1.16
% 2.21/1.16
%------------------------------------------------------------------------------