TSTP Solution File: REL015+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : REL015+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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 : Thu Aug 31 13:40:44 EDT 2023
% Result : Theorem 3.40s 1.16s
% Output : CNFRefutation 3.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 14
% Syntax : Number of formulae : 87 ( 87 unt; 0 def)
% Number of atoms : 87 ( 86 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 112 ( 5 sgn; 51 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',maddux2_join_associativity) ).
fof(f3,axiom,
! [X0,X1] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux3_a_kind_of_de_Morgan) ).
fof(f4,axiom,
! [X0,X1] : complement(join(complement(X0),complement(X1))) = meet(X0,X1),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',composition_associativity) ).
fof(f6,axiom,
! [X0] : composition(X0,one) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composition_identity) ).
fof(f7,axiom,
! [X0,X1,X2] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composition_distributivity) ).
fof(f8,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_idempotence) ).
fof(f9,axiom,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_additivity) ).
fof(f10,axiom,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',converse_cancellativity) ).
fof(f12,axiom,
! [X0] : top = join(X0,complement(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_top) ).
fof(f13,axiom,
! [X0] : zero = meet(X0,complement(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_zero) ).
fof(f14,conjecture,
top = composition(top,top),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
top != composition(top,top),
inference(negated_conjecture,[],[f14]) ).
fof(f16,plain,
top != composition(top,top),
inference(flattening,[],[f15]) ).
fof(f17,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f18,plain,
! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
inference(cnf_transformation,[],[f2]) ).
fof(f19,plain,
! [X0,X1] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f20,plain,
! [X0,X1] : complement(join(complement(X0),complement(X1))) = meet(X0,X1),
inference(cnf_transformation,[],[f4]) ).
fof(f21,plain,
! [X2,X0,X1] : composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f22,plain,
! [X0] : composition(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f23,plain,
! [X2,X0,X1] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
inference(cnf_transformation,[],[f7]) ).
fof(f24,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
fof(f25,plain,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(cnf_transformation,[],[f9]) ).
fof(f26,plain,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f27,plain,
! [X0,X1] : complement(X1) = join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)),
inference(cnf_transformation,[],[f11]) ).
fof(f28,plain,
! [X0] : top = join(X0,complement(X0)),
inference(cnf_transformation,[],[f12]) ).
fof(f29,plain,
! [X0] : zero = meet(X0,complement(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f30,plain,
top != composition(top,top),
inference(cnf_transformation,[],[f16]) ).
fof(f31,plain,
! [X0] : zero = complement(join(complement(X0),complement(complement(X0)))),
inference(definition_unfolding,[],[f29,f20]) ).
cnf(c_49,plain,
join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f17]) ).
cnf(c_50,plain,
join(join(X0,X1),X2) = join(X0,join(X1,X2)),
inference(cnf_transformation,[],[f18]) ).
cnf(c_51,plain,
join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
inference(cnf_transformation,[],[f19]) ).
cnf(c_52,plain,
composition(composition(X0,X1),X2) = composition(X0,composition(X1,X2)),
inference(cnf_transformation,[],[f21]) ).
cnf(c_53,plain,
composition(X0,one) = X0,
inference(cnf_transformation,[],[f22]) ).
cnf(c_54,plain,
join(composition(X0,X1),composition(X2,X1)) = composition(join(X0,X2),X1),
inference(cnf_transformation,[],[f23]) ).
cnf(c_55,plain,
converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f24]) ).
cnf(c_56,plain,
join(converse(X0),converse(X1)) = converse(join(X0,X1)),
inference(cnf_transformation,[],[f25]) ).
cnf(c_57,plain,
composition(converse(X0),converse(X1)) = converse(composition(X1,X0)),
inference(cnf_transformation,[],[f26]) ).
cnf(c_58,plain,
join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1),
inference(cnf_transformation,[],[f27]) ).
cnf(c_59,plain,
join(X0,complement(X0)) = top,
inference(cnf_transformation,[],[f28]) ).
cnf(c_60,plain,
complement(join(complement(X0),complement(complement(X0)))) = zero,
inference(cnf_transformation,[],[f31]) ).
cnf(c_61,negated_conjecture,
composition(top,top) != top,
inference(cnf_transformation,[],[f30]) ).
cnf(c_74,plain,
join(complement(join(complement(X0),X1)),complement(join(complement(X0),complement(X1)))) = X0,
inference(theory_normalisation,[status(thm)],[c_51,c_50,c_49]) ).
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_104,plain,
complement(top) = zero,
inference(ac_demodulation,[status(thm)],[c_60,c_59,c_50,c_49]) ).
cnf(c_179,plain,
converse(join(converse(X0),X1)) = join(X0,converse(X1)),
inference(superposition,[status(thm)],[c_55,c_56]) ).
cnf(c_183,plain,
join(zero,composition(converse(X0),complement(composition(X0,top)))) = zero,
inference(superposition,[status(thm)],[c_104,c_75]) ).
cnf(c_184,plain,
join(complement(X0),composition(X1,complement(composition(converse(X1),X0)))) = complement(X0),
inference(superposition,[status(thm)],[c_55,c_75]) ).
cnf(c_187,plain,
converse(composition(converse(X0),X1)) = composition(converse(X1),X0),
inference(superposition,[status(thm)],[c_55,c_57]) ).
cnf(c_191,plain,
join(X0,join(complement(X0),X1)) = join(top,X1),
inference(superposition,[status(thm)],[c_59,c_50]) ).
cnf(c_196,plain,
composition(X0,composition(one,X1)) = composition(X0,X1),
inference(superposition,[status(thm)],[c_53,c_52]) ).
cnf(c_239,plain,
join(X0,converse(complement(converse(X0)))) = converse(top),
inference(superposition,[status(thm)],[c_59,c_179]) ).
cnf(c_346,plain,
composition(converse(one),X0) = converse(converse(X0)),
inference(superposition,[status(thm)],[c_53,c_187]) ).
cnf(c_367,plain,
composition(converse(one),X0) = X0,
inference(light_normalisation,[status(thm)],[c_346,c_55]) ).
cnf(c_379,plain,
converse(one) = one,
inference(superposition,[status(thm)],[c_367,c_53]) ).
cnf(c_388,plain,
composition(converse(one),X0) = composition(one,X0),
inference(superposition,[status(thm)],[c_367,c_196]) ).
cnf(c_391,plain,
composition(one,X0) = X0,
inference(light_normalisation,[status(thm)],[c_388,c_367]) ).
cnf(c_421,plain,
join(zero,composition(converse(one),complement(top))) = zero,
inference(superposition,[status(thm)],[c_391,c_183]) ).
cnf(c_424,plain,
join(zero,composition(one,zero)) = zero,
inference(light_normalisation,[status(thm)],[c_421,c_104,c_379]) ).
cnf(c_430,plain,
join(zero,zero) = zero,
inference(demodulation,[status(thm)],[c_424,c_391]) ).
cnf(c_431,plain,
join(zero,join(zero,X0)) = join(zero,X0),
inference(superposition,[status(thm)],[c_430,c_50]) ).
cnf(c_509,plain,
join(complement(X0),complement(composition(converse(one),X0))) = complement(X0),
inference(superposition,[status(thm)],[c_391,c_184]) ).
cnf(c_522,plain,
join(complement(X0),complement(X0)) = complement(X0),
inference(light_normalisation,[status(thm)],[c_509,c_379,c_391]) ).
cnf(c_580,plain,
join(complement(join(complement(X0),X0)),complement(complement(X0))) = X0,
inference(superposition,[status(thm)],[c_522,c_74]) ).
cnf(c_581,plain,
join(X0,complement(X0)) = join(top,complement(X0)),
inference(superposition,[status(thm)],[c_522,c_191]) ).
cnf(c_583,plain,
join(top,complement(X0)) = top,
inference(light_normalisation,[status(thm)],[c_581,c_59]) ).
cnf(c_584,plain,
join(complement(complement(X0)),complement(join(X0,complement(X0)))) = X0,
inference(theory_normalisation,[status(thm)],[c_580,c_50,c_49]) ).
cnf(c_585,plain,
join(complement(complement(X0)),zero) = X0,
inference(light_normalisation,[status(thm)],[c_584,c_59,c_104]) ).
cnf(c_586,plain,
join(zero,complement(complement(X0))) = X0,
inference(theory_normalisation,[status(thm)],[c_585,c_50,c_49]) ).
cnf(c_594,plain,
join(zero,X0) = X0,
inference(superposition,[status(thm)],[c_586,c_431]) ).
cnf(c_597,plain,
complement(complement(X0)) = X0,
inference(demodulation,[status(thm)],[c_586,c_594]) ).
cnf(c_598,plain,
composition(converse(X0),complement(composition(X0,top))) = zero,
inference(demodulation,[status(thm)],[c_183,c_594]) ).
cnf(c_608,plain,
complement(zero) = top,
inference(superposition,[status(thm)],[c_594,c_59]) ).
cnf(c_634,plain,
join(top,X0) = top,
inference(superposition,[status(thm)],[c_597,c_583]) ).
cnf(c_662,plain,
join(X0,top) = top,
inference(superposition,[status(thm)],[c_634,c_49]) ).
cnf(c_665,plain,
converse(top) = top,
inference(superposition,[status(thm)],[c_634,c_239]) ).
cnf(c_931,plain,
composition(top,complement(composition(top,top))) = zero,
inference(superposition,[status(thm)],[c_665,c_598]) ).
cnf(c_969,plain,
join(composition(X0,complement(composition(top,top))),zero) = composition(join(X0,top),complement(composition(top,top))),
inference(superposition,[status(thm)],[c_931,c_54]) ).
cnf(c_975,plain,
join(zero,composition(X0,complement(composition(top,top)))) = composition(join(X0,top),complement(composition(top,top))),
inference(theory_normalisation,[status(thm)],[c_969,c_50,c_49]) ).
cnf(c_976,plain,
join(zero,composition(X0,complement(composition(top,top)))) = zero,
inference(light_normalisation,[status(thm)],[c_975,c_662,c_931]) ).
cnf(c_2038,plain,
composition(X0,complement(composition(top,top))) = zero,
inference(demodulation,[status(thm)],[c_976,c_594]) ).
cnf(c_2054,plain,
complement(composition(top,top)) = zero,
inference(superposition,[status(thm)],[c_2038,c_391]) ).
cnf(c_2128,plain,
composition(top,top) = complement(zero),
inference(superposition,[status(thm)],[c_2054,c_597]) ).
cnf(c_2138,plain,
composition(top,top) = top,
inference(light_normalisation,[status(thm)],[c_2128,c_608]) ).
cnf(c_2139,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2138,c_61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : REL015+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri Aug 25 19:15:00 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.40/1.16 % SZS status Started for theBenchmark.p
% 3.40/1.16 % SZS status Theorem for theBenchmark.p
% 3.40/1.16
% 3.40/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.40/1.16
% 3.40/1.16 ------ iProver source info
% 3.40/1.16
% 3.40/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.40/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.40/1.16 git: non_committed_changes: false
% 3.40/1.16 git: last_make_outside_of_git: false
% 3.40/1.16
% 3.40/1.16 ------ Parsing...
% 3.40/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.40/1.16
% 3.40/1.16 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.40/1.16
% 3.40/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.40/1.16
% 3.40/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.40/1.16 ------ Proving...
% 3.40/1.16 ------ Problem Properties
% 3.40/1.16
% 3.40/1.16
% 3.40/1.16 clauses 13
% 3.40/1.16 conjectures 1
% 3.40/1.16 EPR 0
% 3.40/1.16 Horn 13
% 3.40/1.16 unary 13
% 3.40/1.16 binary 0
% 3.40/1.16 lits 13
% 3.40/1.16 lits eq 13
% 3.40/1.16 fd_pure 0
% 3.40/1.16 fd_pseudo 0
% 3.40/1.16 fd_cond 0
% 3.40/1.16 fd_pseudo_cond 0
% 3.40/1.16 AC symbols 1
% 3.40/1.16
% 3.40/1.16 ------ Schedule UEQ
% 3.40/1.16
% 3.40/1.16 ------ Option_UEQ Time Limit: 10.
% 3.40/1.16
% 3.40/1.16
% 3.40/1.16 ------
% 3.40/1.16 Current options:
% 3.40/1.16 ------
% 3.40/1.16
% 3.40/1.16
% 3.40/1.16
% 3.40/1.16
% 3.40/1.16 ------ Proving...
% 3.40/1.16
% 3.40/1.16
% 3.40/1.16 % SZS status Theorem for theBenchmark.p
% 3.40/1.16
% 3.40/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.40/1.16
% 3.40/1.17
%------------------------------------------------------------------------------