TSTP Solution File: REL018+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : REL018+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:47 EDT 2023
% Result : Theorem 0.49s 1.18s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 15
% Syntax : Number of formulae : 97 ( 92 unt; 0 def)
% Number of atoms : 104 ( 103 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 14 ( 7 ~; 0 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 122 ( 3 sgn; 53 !; 2 ?)
% 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(f3,axiom,
! [X0,X1] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
file('/export/starexec/sandbox2/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/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(f7,axiom,
! [X0,X1,X2] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composition_distributivity) ).
fof(f8,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',converse_idempotence) ).
fof(f9,axiom,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',converse_additivity) ).
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] :
( composition(X0,top) = X0
=> complement(X0) = composition(complement(X0),top) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0] :
( composition(X0,top) = X0
=> complement(X0) = composition(complement(X0),top) ),
inference(negated_conjecture,[],[f14]) ).
fof(f16,plain,
? [X0] :
( complement(X0) != composition(complement(X0),top)
& composition(X0,top) = X0 ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
( ? [X0] :
( complement(X0) != composition(complement(X0),top)
& composition(X0,top) = X0 )
=> ( complement(sK0) != composition(complement(sK0),top)
& sK0 = composition(sK0,top) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( complement(sK0) != composition(complement(sK0),top)
& sK0 = composition(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(f21,plain,
! [X0,X1] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
inference(cnf_transformation,[],[f3]) ).
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(f25,plain,
! [X2,X0,X1] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
inference(cnf_transformation,[],[f7]) ).
fof(f26,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
fof(f27,plain,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(cnf_transformation,[],[f9]) ).
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,
sK0 = composition(sK0,top),
inference(cnf_transformation,[],[f18]) ).
fof(f33,plain,
complement(sK0) != composition(complement(sK0),top),
inference(cnf_transformation,[],[f18]) ).
fof(f34,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_51,plain,
join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
inference(cnf_transformation,[],[f21]) ).
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_54,plain,
join(composition(X0,X1),composition(X2,X1)) = composition(join(X0,X2),X1),
inference(cnf_transformation,[],[f25]) ).
cnf(c_55,plain,
converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f26]) ).
cnf(c_56,plain,
join(converse(X0),converse(X1)) = converse(join(X0,X1)),
inference(cnf_transformation,[],[f27]) ).
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,[],[f34]) ).
cnf(c_61,negated_conjecture,
composition(complement(sK0),top) != complement(sK0),
inference(cnf_transformation,[],[f33]) ).
cnf(c_62,negated_conjecture,
composition(sK0,top) = sK0,
inference(cnf_transformation,[],[f32]) ).
cnf(c_75,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_76,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_107,plain,
complement(top) = zero,
inference(ac_demodulation,[status(thm)],[c_60,c_59,c_50,c_49]) ).
cnf(c_189,plain,
join(complement(join(complement(X0),complement(X0))),complement(top)) = X0,
inference(superposition,[status(thm)],[c_59,c_75]) ).
cnf(c_195,plain,
join(complement(top),complement(join(complement(X0),complement(X0)))) = X0,
inference(theory_normalisation,[status(thm)],[c_189,c_50,c_49]) ).
cnf(c_196,plain,
join(zero,complement(join(complement(X0),complement(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_195,c_107]) ).
cnf(c_203,plain,
converse(join(converse(X0),X1)) = join(X0,converse(X1)),
inference(superposition,[status(thm)],[c_55,c_56]) ).
cnf(c_204,plain,
converse(join(X0,converse(X1))) = join(converse(X0),X1),
inference(superposition,[status(thm)],[c_55,c_56]) ).
cnf(c_207,plain,
converse(composition(X0,converse(X1))) = composition(X1,converse(X0)),
inference(superposition,[status(thm)],[c_55,c_57]) ).
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_216,plain,
composition(X0,composition(one,X1)) = composition(X0,X1),
inference(superposition,[status(thm)],[c_53,c_52]) ).
cnf(c_257,plain,
join(X0,converse(complement(converse(X0)))) = converse(top),
inference(superposition,[status(thm)],[c_59,c_203]) ).
cnf(c_291,plain,
join(complement(top),composition(converse(sK0),complement(sK0))) = complement(top),
inference(superposition,[status(thm)],[c_62,c_76]) ).
cnf(c_296,plain,
join(zero,composition(converse(sK0),complement(sK0))) = zero,
inference(light_normalisation,[status(thm)],[c_291,c_107]) ).
cnf(c_370,plain,
composition(converse(one),X0) = converse(converse(X0)),
inference(superposition,[status(thm)],[c_53,c_208]) ).
cnf(c_390,plain,
composition(converse(one),X0) = X0,
inference(light_normalisation,[status(thm)],[c_370,c_55]) ).
cnf(c_504,plain,
join(complement(X0),complement(composition(one,X0))) = complement(X0),
inference(superposition,[status(thm)],[c_390,c_76]) ).
cnf(c_507,plain,
composition(converse(one),X0) = composition(one,X0),
inference(superposition,[status(thm)],[c_390,c_216]) ).
cnf(c_511,plain,
composition(one,X0) = X0,
inference(light_normalisation,[status(thm)],[c_507,c_390]) ).
cnf(c_596,plain,
join(X0,composition(X1,X0)) = composition(join(one,X1),X0),
inference(superposition,[status(thm)],[c_511,c_54]) ).
cnf(c_667,plain,
join(top,complement(complement(X0))) = join(X0,top),
inference(superposition,[status(thm)],[c_59,c_211]) ).
cnf(c_1099,plain,
join(complement(X0),complement(X0)) = complement(X0),
inference(light_normalisation,[status(thm)],[c_504,c_511]) ).
cnf(c_1100,plain,
join(zero,complement(complement(X0))) = X0,
inference(demodulation,[status(thm)],[c_196,c_1099]) ).
cnf(c_1101,plain,
join(zero,zero) = zero,
inference(superposition,[status(thm)],[c_107,c_1099]) ).
cnf(c_1106,plain,
join(X0,complement(X0)) = join(top,complement(X0)),
inference(superposition,[status(thm)],[c_1099,c_211]) ).
cnf(c_1111,plain,
join(top,complement(X0)) = top,
inference(light_normalisation,[status(thm)],[c_1106,c_59]) ).
cnf(c_1120,plain,
join(X0,top) = top,
inference(demodulation,[status(thm)],[c_667,c_1111]) ).
cnf(c_1123,plain,
join(zero,join(zero,X0)) = join(zero,X0),
inference(superposition,[status(thm)],[c_1101,c_50]) ).
cnf(c_1131,plain,
join(top,X0) = top,
inference(superposition,[status(thm)],[c_1120,c_49]) ).
cnf(c_1166,plain,
converse(top) = top,
inference(superposition,[status(thm)],[c_1131,c_257]) ).
cnf(c_1181,plain,
composition(top,converse(X0)) = converse(composition(X0,top)),
inference(superposition,[status(thm)],[c_1166,c_207]) ).
cnf(c_1439,plain,
join(zero,X0) = X0,
inference(superposition,[status(thm)],[c_1100,c_1123]) ).
cnf(c_1448,plain,
composition(converse(sK0),complement(sK0)) = zero,
inference(demodulation,[status(thm)],[c_296,c_1439]) ).
cnf(c_1464,plain,
join(X0,zero) = X0,
inference(superposition,[status(thm)],[c_1439,c_49]) ).
cnf(c_1466,plain,
complement(zero) = top,
inference(superposition,[status(thm)],[c_1439,c_59]) ).
cnf(c_1470,plain,
join(converse(zero),X0) = converse(converse(X0)),
inference(superposition,[status(thm)],[c_1439,c_204]) ).
cnf(c_1480,plain,
join(converse(zero),X0) = X0,
inference(light_normalisation,[status(thm)],[c_1470,c_55]) ).
cnf(c_1839,plain,
converse(zero) = zero,
inference(superposition,[status(thm)],[c_1480,c_1464]) ).
cnf(c_2337,plain,
composition(converse(complement(sK0)),sK0) = converse(zero),
inference(superposition,[status(thm)],[c_1448,c_208]) ).
cnf(c_2338,plain,
composition(converse(complement(sK0)),sK0) = zero,
inference(light_normalisation,[status(thm)],[c_2337,c_1839]) ).
cnf(c_2690,plain,
join(complement(sK0),composition(converse(converse(complement(sK0))),complement(zero))) = complement(sK0),
inference(superposition,[status(thm)],[c_2338,c_76]) ).
cnf(c_2694,plain,
join(complement(sK0),composition(converse(converse(complement(sK0))),top)) = complement(sK0),
inference(light_normalisation,[status(thm)],[c_2690,c_1466]) ).
cnf(c_3527,plain,
join(X0,composition(top,X0)) = composition(top,X0),
inference(superposition,[status(thm)],[c_1120,c_596]) ).
cnf(c_4761,plain,
converse(composition(top,converse(X0))) = composition(X0,top),
inference(superposition,[status(thm)],[c_1181,c_55]) ).
cnf(c_5747,plain,
join(X0,converse(composition(top,converse(X0)))) = converse(composition(top,converse(X0))),
inference(superposition,[status(thm)],[c_3527,c_203]) ).
cnf(c_5776,plain,
join(X0,composition(X0,top)) = composition(X0,top),
inference(light_normalisation,[status(thm)],[c_5747,c_4761]) ).
cnf(c_7219,plain,
composition(complement(sK0),top) = complement(sK0),
inference(demodulation,[status(thm)],[c_2694,c_55,c_5776]) ).
cnf(c_7220,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7219,c_61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : REL018+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.15 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri Aug 25 19:42:48 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.49/1.18 % SZS status Started for theBenchmark.p
% 0.49/1.18 % SZS status Theorem for theBenchmark.p
% 0.49/1.18
% 0.49/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.49/1.18
% 0.49/1.18 ------ iProver source info
% 0.49/1.18
% 0.49/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.49/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.49/1.18 git: non_committed_changes: false
% 0.49/1.18 git: last_make_outside_of_git: false
% 0.49/1.18
% 0.49/1.18 ------ Parsing...
% 0.49/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.49/1.18
% 0.49/1.18 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.49/1.18
% 0.49/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.49/1.18
% 0.49/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.49/1.18 ------ Proving...
% 0.49/1.18 ------ Problem Properties
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18 clauses 14
% 0.49/1.18 conjectures 2
% 0.49/1.18 EPR 0
% 0.49/1.18 Horn 14
% 0.49/1.18 unary 14
% 0.49/1.18 binary 0
% 0.49/1.18 lits 14
% 0.49/1.18 lits eq 14
% 0.49/1.18 fd_pure 0
% 0.49/1.18 fd_pseudo 0
% 0.49/1.18 fd_cond 0
% 0.49/1.18 fd_pseudo_cond 0
% 0.49/1.18 AC symbols 1
% 0.49/1.18
% 0.49/1.18 ------ Schedule UEQ
% 0.49/1.18
% 0.49/1.18 ------ Option_UEQ Time Limit: 10.
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18 ------
% 0.49/1.18 Current options:
% 0.49/1.18 ------
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18 ------ Proving...
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18 % SZS status Theorem for theBenchmark.p
% 0.49/1.18
% 0.49/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.49/1.18
% 1.03/1.20
%------------------------------------------------------------------------------