TSTP Solution File: REL053+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : REL053+1 : TPTP v8.1.2. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:41:11 EDT 2023
% Result : Satisfiable 0.46s 1.17s
% Output : Saturation 0.46s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% 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,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f15,plain,
! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
inference(cnf_transformation,[],[f2]) ).
fof(f16,plain,
! [X0,X1] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f17,plain,
! [X0,X1] : complement(join(complement(X0),complement(X1))) = meet(X0,X1),
inference(cnf_transformation,[],[f4]) ).
fof(f18,plain,
! [X2,X0,X1] : composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f19,plain,
! [X0] : composition(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f20,plain,
! [X2,X0,X1] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
inference(cnf_transformation,[],[f7]) ).
fof(f21,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
fof(f22,plain,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(cnf_transformation,[],[f9]) ).
fof(f23,plain,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f24,plain,
! [X0,X1] : complement(X1) = join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)),
inference(cnf_transformation,[],[f11]) ).
fof(f25,plain,
! [X0] : top = join(X0,complement(X0)),
inference(cnf_transformation,[],[f12]) ).
fof(f26,plain,
! [X0] : zero = meet(X0,complement(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f27,plain,
! [X0] : zero = complement(join(complement(X0),complement(complement(X0)))),
inference(definition_unfolding,[],[f26,f17]) ).
cnf(c_49,plain,
join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f14]) ).
cnf(c_50,plain,
join(join(X0,X1),X2) = join(X0,join(X1,X2)),
inference(cnf_transformation,[],[f15]) ).
cnf(c_51,plain,
join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
inference(cnf_transformation,[],[f16]) ).
cnf(c_52,plain,
composition(composition(X0,X1),X2) = composition(X0,composition(X1,X2)),
inference(cnf_transformation,[],[f18]) ).
cnf(c_53,plain,
composition(X0,one) = X0,
inference(cnf_transformation,[],[f19]) ).
cnf(c_54,plain,
join(composition(X0,X1),composition(X2,X1)) = composition(join(X0,X2),X1),
inference(cnf_transformation,[],[f20]) ).
cnf(c_55,plain,
converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f21]) ).
cnf(c_56,plain,
join(converse(X0),converse(X1)) = converse(join(X0,X1)),
inference(cnf_transformation,[],[f22]) ).
cnf(c_57,plain,
composition(converse(X0),converse(X1)) = converse(composition(X1,X0)),
inference(cnf_transformation,[],[f23]) ).
cnf(c_58,plain,
join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1),
inference(cnf_transformation,[],[f24]) ).
cnf(c_59,plain,
join(X0,complement(X0)) = top,
inference(cnf_transformation,[],[f25]) ).
cnf(c_60,plain,
complement(join(complement(X0),complement(complement(X0)))) = zero,
inference(cnf_transformation,[],[f27]) ).
cnf(c_73,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_74,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_101,plain,
complement(top) = zero,
inference(ac_demodulation,[status(thm)],[c_60,c_59,c_50,c_49]) ).
cnf(c_102,plain,
X0 = X0,
theory(equality) ).
cnf(c_103,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_104,plain,
( X0 != X1
| X2 != X3
| join(X0,X2) = join(X1,X3) ),
theory(equality) ).
cnf(c_105,plain,
( X0 != X1
| complement(X0) = complement(X1) ),
theory(equality) ).
cnf(c_106,plain,
( X0 != X1
| X2 != X3
| composition(X0,X2) = composition(X1,X3) ),
theory(equality) ).
cnf(c_107,plain,
( X0 != X1
| converse(X0) = converse(X1) ),
theory(equality) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : REL053+1 : TPTP v8.1.2. Released v6.4.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.15/0.33 % Computer : n013.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Fri Aug 25 20:34:02 EDT 2023
% 0.15/0.33 % 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 --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.19/0.60 WARNING - Could not infer the problem pformat. Setting FOF as default
% 0.46/1.17 % SZS status Started for theBenchmark.p
% 0.46/1.17 % SZS status Satisfiable for theBenchmark.p
% 0.46/1.17
% 0.46/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.46/1.17
% 0.46/1.17 ------ iProver source info
% 0.46/1.17
% 0.46/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.46/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.46/1.17 git: non_committed_changes: false
% 0.46/1.17 git: last_make_outside_of_git: false
% 0.46/1.17
% 0.46/1.17 ------ Parsing...
% 0.46/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.46/1.17
% 0.46/1.17 ------ Preprocessing... sup_sim: 1 sf_s rm: 18 0s sf_e pe_s pe_e sf_s rm: 6 0s sf_e pe_s pe_e
% 0.46/1.17
% 0.46/1.17 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.46/1.17 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.46/1.17 ------ Proving...
% 0.46/1.17 ------ Problem Properties
% 0.46/1.17
% 0.46/1.17
% 0.46/1.17 clauses 0
% 0.46/1.17 conjectures 0
% 0.46/1.17 EPR 0
% 0.46/1.17 Horn 0
% 0.46/1.17 unary 0
% 0.46/1.17 binary 0
% 0.46/1.17 lits 0
% 0.46/1.17 lits eq 0
% 0.46/1.17 fd_pure 0
% 0.46/1.17 fd_pseudo 0
% 0.46/1.17 fd_cond 0
% 0.46/1.17 fd_pseudo_cond 0
% 0.46/1.17 AC symbols 0
% 0.46/1.17
% 0.46/1.17 ------ Schedule EPR Horn non eq is on
% 0.46/1.17
% 0.46/1.17 ------ no conjectures: strip conj schedule
% 0.46/1.17
% 0.46/1.17 ------ no equalities: superposition off
% 0.46/1.17
% 0.46/1.17 ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 0.46/1.17
% 0.46/1.17
% 0.46/1.17
% 0.46/1.17
% 0.46/1.17 % SZS status Satisfiable for theBenchmark.p
% 0.46/1.17
% 0.46/1.17 % SZS output start Saturation for theBenchmark.p
% See solution above
% 0.46/1.17
% 0.46/1.17
%------------------------------------------------------------------------------