TSTP Solution File: REL008-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : REL008-3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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:34 EDT 2024
% Result : Unsatisfiable 212.18s 27.68s
% Output : CNFRefutation 212.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 2 RR)
% Number of literals : 14 ( 13 equ; 1 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
join(composition(sk1,sk2),composition(sk1,sk3)) != composition(sk1,join(sk2,sk3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_17) ).
cnf(c_59,negated_conjecture,
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_60,negated_conjecture,
converse(converse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(c_61,negated_conjecture,
join(converse(X0),converse(X1)) = converse(join(X0,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
cnf(c_62,negated_conjecture,
composition(converse(X0),converse(X1)) = converse(composition(X1,X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
cnf(c_11756,plain,
converse(composition(converse(X0),X1)) = composition(converse(X1),X0),
inference(superposition,[status(thm)],[c_60,c_62]) ).
cnf(c_11986,plain,
converse(join(X0,converse(X1))) = join(converse(X0),X1),
inference(superposition,[status(thm)],[c_60,c_61]) ).
cnf(c_13251,plain,
join(composition(X0,converse(X1)),converse(composition(X1,X2))) = composition(join(X0,converse(X2)),converse(X1)),
inference(superposition,[status(thm)],[c_62,c_59]) ).
cnf(c_15675,plain,
composition(join(converse(X0),X1),converse(X2)) = converse(composition(X2,join(X0,converse(X1)))),
inference(superposition,[status(thm)],[c_11986,c_62]) ).
cnf(c_16082,plain,
join(composition(converse(X0),X1),converse(X2)) = converse(join(composition(converse(X1),X0),X2)),
inference(superposition,[status(thm)],[c_11756,c_61]) ).
cnf(c_61576,plain,
converse(composition(join(converse(X0),X1),converse(X2))) = composition(X2,join(X0,converse(X1))),
inference(superposition,[status(thm)],[c_15675,c_60]) ).
cnf(c_86231,plain,
join(composition(converse(converse(X0)),X1),converse(converse(composition(X0,X2)))) = converse(composition(join(converse(X1),converse(X2)),converse(X0))),
inference(superposition,[status(thm)],[c_13251,c_16082]) ).
cnf(c_86386,plain,
join(composition(X0,X1),composition(X0,X2)) = composition(X0,join(X1,X2)),
inference(demodulation,[status(thm)],[c_86231,c_60,c_61576]) ).
cnf(c_86477,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_86386]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : REL008-3 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n003.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu May 2 20:01:20 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running UEQ theorem proving
% 0.17/0.45 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
% 212.18/27.68 % SZS status Started for theBenchmark.p
% 212.18/27.68 % SZS status Unsatisfiable for theBenchmark.p
% 212.18/27.68
% 212.18/27.68 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 212.18/27.68
% 212.18/27.68 ------ iProver source info
% 212.18/27.68
% 212.18/27.68 git: date: 2024-05-02 19:28:25 +0000
% 212.18/27.68 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 212.18/27.68 git: non_committed_changes: false
% 212.18/27.68
% 212.18/27.68 ------ Parsing...successful
% 212.18/27.68
% 212.18/27.68
% 212.18/27.68
% 212.18/27.68 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 212.18/27.68
% 212.18/27.68 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 212.18/27.68
% 212.18/27.68 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 212.18/27.68 ------ Proving...
% 212.18/27.68 ------ Problem Properties
% 212.18/27.68
% 212.18/27.68
% 212.18/27.68 clauses 17
% 212.18/27.68 conjectures 17
% 212.18/27.68 EPR 0
% 212.18/27.68 Horn 17
% 212.18/27.68 unary 17
% 212.18/27.68 binary 0
% 212.18/27.68 lits 17
% 212.18/27.68 lits eq 17
% 212.18/27.68 fd_pure 0
% 212.18/27.68 fd_pseudo 0
% 212.18/27.68 fd_cond 0
% 212.18/27.68 fd_pseudo_cond 0
% 212.18/27.68 AC symbols 1
% 212.18/27.68
% 212.18/27.68 ------ Input Options Time Limit: Unbounded
% 212.18/27.68
% 212.18/27.68
% 212.18/27.68 ------
% 212.18/27.68 Current options:
% 212.18/27.68 ------
% 212.18/27.68
% 212.18/27.68
% 212.18/27.68
% 212.18/27.68
% 212.18/27.68 ------ Proving...
% 212.18/27.68
% 212.18/27.68
% 212.18/27.68 % SZS status Unsatisfiable for theBenchmark.p
% 212.18/27.68
% 212.18/27.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 212.18/27.68
% 212.18/27.68
%------------------------------------------------------------------------------