TSTP Solution File: REL023+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : REL023+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:42 EDT 2024
% Result : Theorem 10.13s 2.16s
% Output : CNFRefutation 10.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 14
% Syntax : Number of formulae : 82 ( 81 unt; 0 def)
% Number of atoms : 83 ( 82 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 12 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 121 ( 5 sgn 53 !; 6 ?)
% 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(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,
! [X0,X1,X2] : composition(X0,meet(X1,X2)) = join(composition(meet(X0,converse(X1)),meet(X1,X2)),composition(X0,meet(X1,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0,X1,X2] : composition(X0,meet(X1,X2)) = join(composition(meet(X0,converse(X1)),meet(X1,X2)),composition(X0,meet(X1,X2))),
inference(negated_conjecture,[],[f14]) ).
fof(f16,plain,
? [X0,X1,X2] : composition(X0,meet(X1,X2)) != join(composition(meet(X0,converse(X1)),meet(X1,X2)),composition(X0,meet(X1,X2))),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
( ? [X0,X1,X2] : composition(X0,meet(X1,X2)) != join(composition(meet(X0,converse(X1)),meet(X1,X2)),composition(X0,meet(X1,X2)))
=> composition(sK0,meet(sK1,sK2)) != join(composition(meet(sK0,converse(sK1)),meet(sK1,sK2)),composition(sK0,meet(sK1,sK2))) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
composition(sK0,meet(sK1,sK2)) != join(composition(meet(sK0,converse(sK1)),meet(sK1,sK2)),composition(sK0,meet(sK1,sK2))),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[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(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,
composition(sK0,meet(sK1,sK2)) != join(composition(meet(sK0,converse(sK1)),meet(sK1,sK2)),composition(sK0,meet(sK1,sK2))),
inference(cnf_transformation,[],[f18]) ).
fof(f33,plain,
! [X0] : zero = complement(join(complement(X0),complement(complement(X0)))),
inference(definition_unfolding,[],[f31,f22]) ).
fof(f34,plain,
composition(sK0,complement(join(complement(sK1),complement(sK2)))) != join(composition(complement(join(complement(sK0),complement(converse(sK1)))),complement(join(complement(sK1),complement(sK2)))),composition(sK0,complement(join(complement(sK1),complement(sK2))))),
inference(definition_unfolding,[],[f32,f22,f22,f22,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_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(composition(complement(join(complement(sK0),complement(converse(sK1)))),complement(join(complement(sK1),complement(sK2)))),composition(sK0,complement(join(complement(sK1),complement(sK2))))) != composition(sK0,complement(join(complement(sK1),complement(sK2)))),
inference(cnf_transformation,[],[f34]) ).
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_76,negated_conjecture,
join(composition(sK0,complement(join(complement(sK1),complement(sK2)))),composition(complement(join(complement(sK0),complement(converse(sK1)))),complement(join(complement(sK1),complement(sK2))))) != composition(sK0,complement(join(complement(sK1),complement(sK2)))),
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_106,plain,
composition(join(complement(join(complement(sK0),complement(converse(sK1)))),sK0),complement(join(complement(sK1),complement(sK2)))) != composition(sK0,complement(join(complement(sK1),complement(sK2)))),
inference(ac_demodulation,[status(thm)],[c_76,c_54,c_50,c_49]) ).
cnf(c_107,plain,
composition(join(sK0,complement(join(complement(sK0),complement(converse(sK1))))),complement(join(complement(sK1),complement(sK2)))) != composition(sK0,complement(join(complement(sK1),complement(sK2)))),
inference(theory_normalisation,[status(thm)],[c_106,c_50,c_49]) ).
cnf(c_193,plain,
join(complement(join(complement(X0),complement(X0))),complement(top)) = X0,
inference(superposition,[status(thm)],[c_59,c_74]) ).
cnf(c_199,plain,
join(complement(top),complement(join(complement(X0),complement(X0)))) = X0,
inference(theory_normalisation,[status(thm)],[c_193,c_50,c_49]) ).
cnf(c_200,plain,
join(zero,complement(join(complement(X0),complement(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_199,c_105]) ).
cnf(c_206,plain,
converse(composition(converse(X0),X1)) = composition(converse(X1),X0),
inference(superposition,[status(thm)],[c_55,c_57]) ).
cnf(c_209,plain,
join(X0,join(complement(X0),X1)) = join(top,X1),
inference(superposition,[status(thm)],[c_59,c_50]) ).
cnf(c_214,plain,
composition(X0,composition(one,X1)) = composition(X0,X1),
inference(superposition,[status(thm)],[c_53,c_52]) ).
cnf(c_347,plain,
composition(converse(one),X0) = converse(converse(X0)),
inference(superposition,[status(thm)],[c_53,c_206]) ).
cnf(c_367,plain,
composition(converse(one),X0) = X0,
inference(light_normalisation,[status(thm)],[c_347,c_55]) ).
cnf(c_383,plain,
join(complement(X0),complement(composition(one,X0))) = complement(X0),
inference(superposition,[status(thm)],[c_367,c_75]) ).
cnf(c_386,plain,
composition(converse(one),X0) = composition(one,X0),
inference(superposition,[status(thm)],[c_367,c_214]) ).
cnf(c_389,plain,
composition(one,X0) = X0,
inference(light_normalisation,[status(thm)],[c_386,c_367]) ).
cnf(c_494,plain,
join(top,complement(complement(X0))) = join(X0,top),
inference(superposition,[status(thm)],[c_59,c_209]) ).
cnf(c_876,plain,
join(complement(X0),complement(X0)) = complement(X0),
inference(light_normalisation,[status(thm)],[c_383,c_389]) ).
cnf(c_877,plain,
join(zero,complement(complement(X0))) = X0,
inference(demodulation,[status(thm)],[c_200,c_876]) ).
cnf(c_878,plain,
join(zero,zero) = zero,
inference(superposition,[status(thm)],[c_105,c_876]) ).
cnf(c_884,plain,
join(X0,complement(X0)) = join(top,complement(X0)),
inference(superposition,[status(thm)],[c_876,c_209]) ).
cnf(c_887,plain,
join(top,complement(X0)) = top,
inference(light_normalisation,[status(thm)],[c_884,c_59]) ).
cnf(c_893,plain,
join(X0,top) = top,
inference(demodulation,[status(thm)],[c_494,c_887]) ).
cnf(c_901,plain,
join(zero,join(zero,X0)) = join(zero,X0),
inference(superposition,[status(thm)],[c_878,c_50]) ).
cnf(c_914,plain,
join(complement(top),complement(join(complement(X0),complement(top)))) = X0,
inference(superposition,[status(thm)],[c_893,c_74]) ).
cnf(c_920,plain,
join(zero,complement(join(complement(X0),zero))) = X0,
inference(light_normalisation,[status(thm)],[c_914,c_105]) ).
cnf(c_921,plain,
join(zero,complement(join(zero,complement(X0)))) = X0,
inference(theory_normalisation,[status(thm)],[c_920,c_50,c_49]) ).
cnf(c_1023,plain,
join(zero,X0) = X0,
inference(superposition,[status(thm)],[c_921,c_901]) ).
cnf(c_1196,plain,
complement(complement(X0)) = X0,
inference(demodulation,[status(thm)],[c_877,c_1023]) ).
cnf(c_1200,plain,
join(X0,X0) = X0,
inference(superposition,[status(thm)],[c_1196,c_876]) ).
cnf(c_1202,plain,
join(complement(join(X0,X1)),complement(join(X0,complement(X1)))) = complement(X0),
inference(superposition,[status(thm)],[c_1196,c_74]) ).
cnf(c_1218,plain,
join(X0,join(X0,X1)) = join(X0,X1),
inference(superposition,[status(thm)],[c_1200,c_50]) ).
cnf(c_26937,plain,
join(complement(join(X0,X1)),complement(X0)) = complement(X0),
inference(superposition,[status(thm)],[c_1202,c_1218]) ).
cnf(c_26968,plain,
join(complement(X0),complement(join(X0,X1))) = complement(X0),
inference(theory_normalisation,[status(thm)],[c_26937,c_50,c_49]) ).
cnf(c_27146,plain,
join(X0,complement(join(complement(X0),X1))) = X0,
inference(superposition,[status(thm)],[c_1196,c_26968]) ).
cnf(c_27405,plain,
composition(sK0,complement(join(complement(sK1),complement(sK2)))) != composition(sK0,complement(join(complement(sK1),complement(sK2)))),
inference(demodulation,[status(thm)],[c_107,c_27146]) ).
cnf(c_27406,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_27405]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL023+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n021.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:58:28 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 10.13/2.16 % SZS status Started for theBenchmark.p
% 10.13/2.16 % SZS status Theorem for theBenchmark.p
% 10.13/2.16
% 10.13/2.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.13/2.16
% 10.13/2.16 ------ iProver source info
% 10.13/2.16
% 10.13/2.16 git: date: 2024-05-02 19:28:25 +0000
% 10.13/2.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.13/2.16 git: non_committed_changes: false
% 10.13/2.16
% 10.13/2.16 ------ Parsing...
% 10.13/2.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.13/2.16
% 10.13/2.16 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 10.13/2.16
% 10.13/2.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.13/2.16
% 10.13/2.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 10.13/2.16 ------ Proving...
% 10.13/2.16 ------ Problem Properties
% 10.13/2.16
% 10.13/2.16
% 10.13/2.16 clauses 13
% 10.13/2.16 conjectures 0
% 10.13/2.16 EPR 0
% 10.13/2.16 Horn 13
% 10.13/2.16 unary 13
% 10.13/2.16 binary 0
% 10.13/2.16 lits 13
% 10.13/2.16 lits eq 13
% 10.13/2.16 fd_pure 0
% 10.13/2.16 fd_pseudo 0
% 10.13/2.16 fd_cond 0
% 10.13/2.16 fd_pseudo_cond 0
% 10.13/2.16 AC symbols 1
% 10.13/2.16
% 10.13/2.16 ------ Schedule UEQ
% 10.13/2.16
% 10.13/2.16 ------ Option_UEQ Time Limit: 10.
% 10.13/2.16
% 10.13/2.16
% 10.13/2.16 ------
% 10.13/2.16 Current options:
% 10.13/2.16 ------
% 10.13/2.16
% 10.13/2.16
% 10.13/2.16
% 10.13/2.16
% 10.13/2.16 ------ Proving...
% 10.13/2.16
% 10.13/2.16
% 10.13/2.16 % SZS status Theorem for theBenchmark.p
% 10.13/2.16
% 10.13/2.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.13/2.16
% 10.13/2.16
%------------------------------------------------------------------------------