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 : n008.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:41 EDT 2024
% Result : Unsatisfiable 0.42s 1.12s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 7 RR)
% Number of literals : 46 ( 45 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 61 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
join(composition(meet(sk1,converse(sk2)),meet(sk2,sk3)),composition(sk1,meet(sk2,sk3))) != composition(sk1,meet(sk2,sk3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14) ).
cnf(c_50,plain,
join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(c_51,plain,
join(join(X0,X1),X2) = join(X0,join(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).
cnf(c_52,plain,
join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux3_a_kind_of_de_Morgan_3) ).
cnf(c_53,plain,
complement(join(complement(X0),complement(X1))) = meet(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).
cnf(c_54,plain,
composition(composition(X0,X1),X2) = composition(X0,composition(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_associativity_5) ).
cnf(c_55,plain,
composition(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_identity_6) ).
cnf(c_56,plain,
join(composition(X0,X1),composition(X2,X1)) = composition(join(X0,X2),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).
cnf(c_57,plain,
converse(converse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(c_59,plain,
composition(converse(X0),converse(X1)) = converse(composition(X1,X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
cnf(c_60,plain,
join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).
cnf(c_61,plain,
join(X0,complement(X0)) = top,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_top_12) ).
cnf(c_62,plain,
meet(X0,complement(X0)) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
cnf(c_76,negated_conjecture,
join(composition(sk1,meet(sk2,sk3)),composition(meet(sk1,converse(sk2)),meet(sk2,sk3))) != composition(sk1,meet(sk2,sk3)),
inference(theory_normalisation,[status(thm)],[c_49,c_51,c_50]) ).
cnf(c_77,plain,
join(complement(join(complement(X0),X1)),complement(join(complement(X0),complement(X1)))) = X0,
inference(theory_normalisation,[status(thm)],[c_52,c_51,c_50]) ).
cnf(c_78,plain,
join(complement(X0),composition(converse(X1),complement(composition(X1,X0)))) = complement(X0),
inference(theory_normalisation,[status(thm)],[c_60,c_51,c_50]) ).
cnf(c_109,plain,
join(complement(join(complement(X0),X1)),meet(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_77,c_53]) ).
cnf(c_110,plain,
join(meet(X0,X1),complement(join(complement(X0),X1))) = X0,
inference(theory_normalisation,[status(thm)],[c_109,c_51,c_50]) ).
cnf(c_111,plain,
composition(join(sk1,meet(sk1,converse(sk2))),meet(sk2,sk3)) != composition(sk1,meet(sk2,sk3)),
inference(demodulation,[status(thm)],[c_76,c_56]) ).
cnf(c_199,plain,
meet(X0,complement(X0)) = complement(top),
inference(superposition,[status(thm)],[c_61,c_53]) ).
cnf(c_206,plain,
complement(top) = zero,
inference(light_normalisation,[status(thm)],[c_199,c_62]) ).
cnf(c_228,plain,
converse(composition(converse(X0),X1)) = composition(converse(X1),X0),
inference(superposition,[status(thm)],[c_57,c_59]) ).
cnf(c_241,plain,
composition(X0,composition(one,X1)) = composition(X0,X1),
inference(superposition,[status(thm)],[c_55,c_54]) ).
cnf(c_299,plain,
join(zero,complement(join(complement(X0),complement(X0)))) = X0,
inference(superposition,[status(thm)],[c_62,c_110]) ).
cnf(c_303,plain,
join(meet(X0,complement(X1)),meet(X0,X1)) = X0,
inference(superposition,[status(thm)],[c_53,c_110]) ).
cnf(c_306,plain,
join(meet(X0,complement(complement(X0))),complement(top)) = X0,
inference(superposition,[status(thm)],[c_61,c_110]) ).
cnf(c_315,plain,
join(complement(top),meet(X0,complement(complement(X0)))) = X0,
inference(theory_normalisation,[status(thm)],[c_306,c_51,c_50]) ).
cnf(c_316,plain,
join(zero,meet(X0,complement(complement(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_315,c_206]) ).
cnf(c_317,plain,
join(meet(X0,X1),meet(X0,complement(X1))) = X0,
inference(theory_normalisation,[status(thm)],[c_303,c_51,c_50]) ).
cnf(c_581,plain,
composition(converse(one),X0) = converse(converse(X0)),
inference(superposition,[status(thm)],[c_55,c_228]) ).
cnf(c_601,plain,
composition(converse(one),X0) = X0,
inference(light_normalisation,[status(thm)],[c_581,c_57]) ).
cnf(c_623,plain,
join(complement(X0),complement(composition(one,X0))) = complement(X0),
inference(superposition,[status(thm)],[c_601,c_78]) ).
cnf(c_626,plain,
composition(converse(one),X0) = composition(one,X0),
inference(superposition,[status(thm)],[c_601,c_241]) ).
cnf(c_629,plain,
composition(one,X0) = X0,
inference(light_normalisation,[status(thm)],[c_626,c_601]) ).
cnf(c_1854,plain,
join(complement(X0),complement(X0)) = complement(X0),
inference(light_normalisation,[status(thm)],[c_623,c_629]) ).
cnf(c_1855,plain,
join(zero,complement(complement(X0))) = X0,
inference(demodulation,[status(thm)],[c_299,c_1854]) ).
cnf(c_1867,plain,
join(zero,zero) = zero,
inference(superposition,[status(thm)],[c_206,c_1854]) ).
cnf(c_1913,plain,
join(zero,join(zero,X0)) = join(zero,X0),
inference(superposition,[status(thm)],[c_1867,c_51]) ).
cnf(c_2147,plain,
join(zero,X0) = X0,
inference(superposition,[status(thm)],[c_316,c_1913]) ).
cnf(c_2426,plain,
complement(complement(X0)) = X0,
inference(superposition,[status(thm)],[c_1855,c_2147]) ).
cnf(c_2452,plain,
join(X0,X0) = X0,
inference(superposition,[status(thm)],[c_2426,c_1854]) ).
cnf(c_2490,plain,
join(X0,join(X0,X1)) = join(X0,X1),
inference(superposition,[status(thm)],[c_2452,c_51]) ).
cnf(c_2527,plain,
join(meet(X0,X1),X0) = X0,
inference(superposition,[status(thm)],[c_317,c_2490]) ).
cnf(c_2542,plain,
join(X0,meet(X0,X1)) = X0,
inference(theory_normalisation,[status(thm)],[c_2527,c_51,c_50]) ).
cnf(c_2555,plain,
composition(sk1,meet(sk2,sk3)) != composition(sk1,meet(sk2,sk3)),
inference(demodulation,[status(thm)],[c_111,c_2542]) ).
cnf(c_2556,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_2555]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : REL023-1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n008.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 19:59:13 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running UEQ theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.42/1.12 % SZS status Started for theBenchmark.p
% 0.42/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 0.42/1.12
% 0.42/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.42/1.12
% 0.42/1.12 ------ iProver source info
% 0.42/1.12
% 0.42/1.12 git: date: 2024-05-02 19:28:25 +0000
% 0.42/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.42/1.12 git: non_committed_changes: false
% 0.42/1.12
% 0.42/1.12 ------ Parsing...successful
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.42/1.12
% 0.42/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.42/1.12
% 0.42/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.42/1.12 ------ Proving...
% 0.42/1.12 ------ Problem Properties
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 clauses 14
% 0.42/1.12 conjectures 0
% 0.42/1.12 EPR 0
% 0.42/1.12 Horn 14
% 0.42/1.12 unary 14
% 0.42/1.12 binary 0
% 0.42/1.12 lits 14
% 0.42/1.12 lits eq 14
% 0.42/1.12 fd_pure 0
% 0.42/1.12 fd_pseudo 0
% 0.42/1.12 fd_cond 0
% 0.42/1.12 fd_pseudo_cond 0
% 0.42/1.12 AC symbols 1
% 0.42/1.12
% 0.42/1.12 ------ Input Options Time Limit: Unbounded
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 ------
% 0.42/1.12 Current options:
% 0.42/1.12 ------
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 ------ Proving...
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 0.42/1.12
% 0.42/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.42/1.12
% 0.42/1.12
%------------------------------------------------------------------------------