TSTP Solution File: REL002+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : REL002+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 02:56:30 EDT 2024
% Result : Theorem 3.40s 1.15s
% Output : CNFRefutation 3.40s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maddux1_join_commutativity) ).
fof(f2,axiom,
! [X0,X1,X2] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maddux2_join_associativity) ).
fof(f4,axiom,
! [X0,X1] : complement(join(complement(X0),complement(X1))) = meet(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maddux4_definiton_of_meet) ).
fof(f5,axiom,
! [X0,X1,X2] : composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composition_associativity) ).
fof(f6,axiom,
! [X0] : composition(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composition_identity) ).
fof(f8,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',converse_idempotence) ).
fof(f10,axiom,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',converse_multiplicativity) ).
fof(f11,axiom,
! [X0,X1] : complement(X1) = join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',converse_cancellativity) ).
fof(f12,axiom,
! [X0] : top = join(X0,complement(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_top) ).
fof(f13,axiom,
! [X0] : zero = meet(X0,complement(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_zero) ).
fof(f14,conjecture,
! [X0] : top = join(X0,top),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0] : top = join(X0,top),
inference(negated_conjecture,[],[f14]) ).
fof(f16,plain,
? [X0] : top != join(X0,top),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
( ? [X0] : top != join(X0,top)
=> top != join(sK0,top) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
top != join(sK0,top),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f16,f17]) ).
fof(f19,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f20,plain,
! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
inference(cnf_transformation,[],[f2]) ).
fof(f22,plain,
! [X0,X1] : complement(join(complement(X0),complement(X1))) = meet(X0,X1),
inference(cnf_transformation,[],[f4]) ).
fof(f23,plain,
! [X2,X0,X1] : composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f24,plain,
! [X0] : composition(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f26,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
fof(f28,plain,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f29,plain,
! [X0,X1] : complement(X1) = join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)),
inference(cnf_transformation,[],[f11]) ).
fof(f30,plain,
! [X0] : top = join(X0,complement(X0)),
inference(cnf_transformation,[],[f12]) ).
fof(f31,plain,
! [X0] : zero = meet(X0,complement(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f32,plain,
top != join(sK0,top),
inference(cnf_transformation,[],[f18]) ).
fof(f33,plain,
! [X0] : zero = complement(join(complement(X0),complement(complement(X0)))),
inference(definition_unfolding,[],[f31,f22]) ).
cnf(c_49,plain,
join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f19]) ).
cnf(c_50,plain,
join(join(X0,X1),X2) = join(X0,join(X1,X2)),
inference(cnf_transformation,[],[f20]) ).
cnf(c_52,plain,
composition(composition(X0,X1),X2) = composition(X0,composition(X1,X2)),
inference(cnf_transformation,[],[f23]) ).
cnf(c_53,plain,
composition(X0,one) = X0,
inference(cnf_transformation,[],[f24]) ).
cnf(c_55,plain,
converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f26]) ).
cnf(c_57,plain,
composition(converse(X0),converse(X1)) = converse(composition(X1,X0)),
inference(cnf_transformation,[],[f28]) ).
cnf(c_58,plain,
join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1),
inference(cnf_transformation,[],[f29]) ).
cnf(c_59,plain,
join(X0,complement(X0)) = top,
inference(cnf_transformation,[],[f30]) ).
cnf(c_60,plain,
complement(join(complement(X0),complement(complement(X0)))) = zero,
inference(cnf_transformation,[],[f33]) ).
cnf(c_61,negated_conjecture,
join(sK0,top) != top,
inference(cnf_transformation,[],[f32]) ).
cnf(c_75,plain,
join(complement(X0),composition(converse(X1),complement(composition(X1,X0)))) = complement(X0),
inference(theory_normalisation,[status(thm)],[c_58,c_50,c_49]) ).
cnf(c_76,negated_conjecture,
join(top,sK0) != top,
inference(theory_normalisation,[status(thm)],[c_61,c_50,c_49]) ).
cnf(c_105,plain,
complement(top) = zero,
inference(ac_demodulation,[status(thm)],[c_60,c_59,c_50,c_49]) ).
cnf(c_112,plain,
join(top,sK0) = sP0_iProver_def,
definition ).
cnf(c_113,negated_conjecture,
sP0_iProver_def != top,
inference(demodulation,[status(thm)],[c_76,c_112]) ).
cnf(c_180,plain,
join(X0,join(X1,X2)) = join(X1,join(X0,X2)),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_181,plain,
join(top,zero) = top,
inference(superposition,[status(thm)],[c_105,c_59]) ).
cnf(c_208,plain,
converse(composition(converse(X0),X1)) = composition(converse(X1),X0),
inference(superposition,[status(thm)],[c_55,c_57]) ).
cnf(c_211,plain,
join(X0,join(complement(X0),X1)) = join(top,X1),
inference(superposition,[status(thm)],[c_59,c_50]) ).
cnf(c_213,plain,
join(top,join(sK0,X0)) = join(sP0_iProver_def,X0),
inference(superposition,[status(thm)],[c_112,c_50]) ).
cnf(c_214,plain,
join(top,join(zero,X0)) = join(top,X0),
inference(superposition,[status(thm)],[c_181,c_50]) ).
cnf(c_217,plain,
composition(X0,composition(one,X1)) = composition(X0,X1),
inference(superposition,[status(thm)],[c_53,c_52]) ).
cnf(c_221,plain,
join(top,join(X0,sK0)) = join(sP0_iProver_def,X0),
inference(superposition,[status(thm)],[c_49,c_213]) ).
cnf(c_229,plain,
join(top,join(X0,zero)) = join(top,X0),
inference(superposition,[status(thm)],[c_49,c_214]) ).
cnf(c_248,plain,
join(top,sK0) = join(sP0_iProver_def,zero),
inference(superposition,[status(thm)],[c_221,c_214]) ).
cnf(c_249,plain,
join(sP0_iProver_def,zero) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_248,c_112]) ).
cnf(c_392,plain,
composition(converse(one),X0) = converse(converse(X0)),
inference(superposition,[status(thm)],[c_53,c_208]) ).
cnf(c_412,plain,
composition(converse(one),X0) = X0,
inference(light_normalisation,[status(thm)],[c_392,c_55]) ).
cnf(c_428,plain,
join(complement(X0),complement(composition(one,X0))) = complement(X0),
inference(superposition,[status(thm)],[c_412,c_75]) ).
cnf(c_431,plain,
composition(converse(one),X0) = composition(one,X0),
inference(superposition,[status(thm)],[c_412,c_217]) ).
cnf(c_434,plain,
composition(one,X0) = X0,
inference(light_normalisation,[status(thm)],[c_431,c_412]) ).
cnf(c_502,plain,
join(top,join(X0,zero)) = join(X0,top),
inference(superposition,[status(thm)],[c_181,c_180]) ).
cnf(c_789,plain,
join(top,complement(complement(X0))) = join(X0,top),
inference(superposition,[status(thm)],[c_59,c_211]) ).
cnf(c_1224,plain,
join(complement(X0),complement(X0)) = complement(X0),
inference(light_normalisation,[status(thm)],[c_428,c_434]) ).
cnf(c_1232,plain,
join(X0,complement(X0)) = join(top,complement(X0)),
inference(superposition,[status(thm)],[c_1224,c_211]) ).
cnf(c_1237,plain,
join(top,complement(X0)) = top,
inference(light_normalisation,[status(thm)],[c_1232,c_59]) ).
cnf(c_1247,plain,
join(X0,top) = top,
inference(demodulation,[status(thm)],[c_789,c_1237]) ).
cnf(c_1251,plain,
join(top,join(X0,zero)) = top,
inference(demodulation,[status(thm)],[c_502,c_1247]) ).
cnf(c_1253,plain,
join(top,X0) = top,
inference(demodulation,[status(thm)],[c_229,c_1251]) ).
cnf(c_1260,plain,
join(sP0_iProver_def,X0) = top,
inference(demodulation,[status(thm)],[c_221,c_1253]) ).
cnf(c_1263,plain,
top = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_249,c_1260]) ).
cnf(c_1271,plain,
sP0_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_113,c_1263]) ).
cnf(c_1272,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_1271]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : REL002+1 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 19:41:34 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.40/1.15 % SZS status Started for theBenchmark.p
% 3.40/1.15 % SZS status Theorem for theBenchmark.p
% 3.40/1.15
% 3.40/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.40/1.15
% 3.40/1.15 ------ iProver source info
% 3.40/1.15
% 3.40/1.15 git: date: 2024-05-02 19:28:25 +0000
% 3.40/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.40/1.15 git: non_committed_changes: false
% 3.40/1.15
% 3.40/1.15 ------ Parsing...
% 3.40/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.40/1.15
% 3.40/1.15 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.40/1.15
% 3.40/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.40/1.15
% 3.40/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.40/1.15 ------ Proving...
% 3.40/1.15 ------ Problem Properties
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15 clauses 14
% 3.40/1.15 conjectures 1
% 3.40/1.15 EPR 1
% 3.40/1.15 Horn 14
% 3.40/1.15 unary 14
% 3.40/1.15 binary 0
% 3.40/1.15 lits 14
% 3.40/1.15 lits eq 14
% 3.40/1.15 fd_pure 0
% 3.40/1.15 fd_pseudo 0
% 3.40/1.15 fd_cond 0
% 3.40/1.15 fd_pseudo_cond 0
% 3.40/1.15 AC symbols 1
% 3.40/1.15
% 3.40/1.15 ------ Schedule UEQ
% 3.40/1.15
% 3.40/1.15 ------ Option_UEQ Time Limit: 10.
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15 ------
% 3.40/1.15 Current options:
% 3.40/1.15 ------
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15 ------ Proving...
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15 % SZS status Theorem for theBenchmark.p
% 3.40/1.15
% 3.40/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.40/1.15
% 3.40/1.15
%------------------------------------------------------------------------------