TSTP Solution File: REL008+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : REL008+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:38 EDT 2023
% Result : Theorem 140.72s 19.34s
% Output : CNFRefutation 140.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 34 unt; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 8 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 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 : 73 ( 0 sgn; 32 !; 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(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(f9,axiom,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_additivity) ).
fof(f10,axiom,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_multiplicativity) ).
fof(f14,conjecture,
! [X0,X1,X2] : composition(X0,join(X1,X2)) = join(composition(X0,X1),composition(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0,X1,X2] : composition(X0,join(X1,X2)) = join(composition(X0,X1),composition(X0,X2)),
inference(negated_conjecture,[],[f14]) ).
fof(f16,plain,
? [X0,X1,X2] : composition(X0,join(X1,X2)) != join(composition(X0,X1),composition(X0,X2)),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
( ? [X0,X1,X2] : composition(X0,join(X1,X2)) != join(composition(X0,X1),composition(X0,X2))
=> composition(sK0,join(sK1,sK2)) != join(composition(sK0,sK1),composition(sK0,sK2)) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
composition(sK0,join(sK1,sK2)) != join(composition(sK0,sK1),composition(sK0,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(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(f32,plain,
composition(sK0,join(sK1,sK2)) != join(composition(sK0,sK1),composition(sK0,sK2)),
inference(cnf_transformation,[],[f18]) ).
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_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_61,negated_conjecture,
join(composition(sK0,sK1),composition(sK0,sK2)) != composition(sK0,join(sK1,sK2)),
inference(cnf_transformation,[],[f32]) ).
cnf(c_13420,plain,
converse(join(converse(X0),X1)) = join(X0,converse(X1)),
inference(superposition,[status(thm)],[c_55,c_56]) ).
cnf(c_13453,plain,
converse(composition(converse(X0),X1)) = composition(converse(X1),X0),
inference(superposition,[status(thm)],[c_55,c_57]) ).
cnf(c_13530,plain,
composition(converse(X0),join(X1,converse(X2))) = converse(composition(join(converse(X1),X2),X0)),
inference(superposition,[status(thm)],[c_13420,c_57]) ).
cnf(c_13581,plain,
join(composition(X0,X1),composition(X2,X1)) = composition(join(X2,X0),X1),
inference(superposition,[status(thm)],[c_54,c_49]) ).
cnf(c_14116,plain,
join(composition(converse(X0),X1),converse(X2)) = converse(join(composition(converse(X1),X0),X2)),
inference(superposition,[status(thm)],[c_13453,c_56]) ).
cnf(c_31664,plain,
join(composition(X0,converse(X1)),converse(composition(X1,X2))) = composition(join(converse(X2),X0),converse(X1)),
inference(superposition,[status(thm)],[c_57,c_13581]) ).
cnf(c_31859,plain,
join(composition(converse(converse(X0)),X1),converse(converse(composition(X0,X2)))) = converse(composition(join(converse(X2),converse(X1)),converse(X0))),
inference(superposition,[status(thm)],[c_31664,c_14116]) ).
cnf(c_31877,plain,
join(composition(X0,X1),composition(X0,X2)) = composition(X0,join(X2,X1)),
inference(demodulation,[status(thm)],[c_31859,c_55,c_13530]) ).
cnf(c_31907,plain,
composition(sK0,join(sK1,sK2)) != composition(sK0,join(sK2,sK1)),
inference(demodulation,[status(thm)],[c_61,c_31877]) ).
cnf(c_31908,plain,
$false,
inference(theory_normalisation,[status(thm)],[c_31907,c_50,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : REL008+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 25 20:34:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 140.72/19.34 % SZS status Started for theBenchmark.p
% 140.72/19.34 % SZS status Theorem for theBenchmark.p
% 140.72/19.34
% 140.72/19.34 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 140.72/19.34
% 140.72/19.34 ------ iProver source info
% 140.72/19.34
% 140.72/19.34 git: date: 2023-05-31 18:12:56 +0000
% 140.72/19.34 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 140.72/19.34 git: non_committed_changes: false
% 140.72/19.34 git: last_make_outside_of_git: false
% 140.72/19.34
% 140.72/19.34 ------ Parsing...
% 140.72/19.34 ------ Clausification by vclausify_rel & Parsing by iProver...
% 140.72/19.34
% 140.72/19.34 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 140.72/19.34
% 140.72/19.34 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 140.72/19.34
% 140.72/19.34 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 140.72/19.34 ------ Proving...
% 140.72/19.34 ------ Problem Properties
% 140.72/19.34
% 140.72/19.34
% 140.72/19.34 clauses 13
% 140.72/19.34 conjectures 1
% 140.72/19.34 EPR 0
% 140.72/19.34 Horn 13
% 140.72/19.34 unary 13
% 140.72/19.34 binary 0
% 140.72/19.34 lits 13
% 140.72/19.34 lits eq 13
% 140.72/19.34 fd_pure 0
% 140.72/19.34 fd_pseudo 0
% 140.72/19.34 fd_cond 0
% 140.72/19.34 fd_pseudo_cond 0
% 140.72/19.34 AC symbols 1
% 140.72/19.34
% 140.72/19.34 ------ Input Options Time Limit: Unbounded
% 140.72/19.34
% 140.72/19.34
% 140.72/19.34 ------
% 140.72/19.34 Current options:
% 140.72/19.34 ------
% 140.72/19.34
% 140.72/19.34
% 140.72/19.34
% 140.72/19.34
% 140.72/19.34 ------ Proving...
% 140.72/19.34
% 140.72/19.34
% 140.72/19.34 % SZS status Theorem for theBenchmark.p
% 140.72/19.34
% 140.72/19.34 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 140.72/19.34
% 140.72/19.34
%------------------------------------------------------------------------------