TSTP Solution File: REL031+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : REL031+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:58 EDT 2023
% Result : Theorem 3.57s 1.17s
% Output : CNFRefutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 56 ( 50 unt; 0 def)
% Number of atoms : 71 ( 70 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 24 ( 9 ~; 0 |; 12 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 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 : 77 ( 0 sgn; 38 !; 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(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(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(f17,conjecture,
! [X0,X1] :
( ( one = join(composition(converse(X1),X1),one)
& one = join(composition(converse(X0),X0),one) )
=> one = join(composition(converse(composition(X0,X1)),composition(X0,X1)),one) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0,X1] :
( ( one = join(composition(converse(X1),X1),one)
& one = join(composition(converse(X0),X0),one) )
=> one = join(composition(converse(composition(X0,X1)),composition(X0,X1)),one) ),
inference(negated_conjecture,[],[f17]) ).
fof(f19,plain,
? [X0,X1] :
( one != join(composition(converse(composition(X0,X1)),composition(X0,X1)),one)
& one = join(composition(converse(X1),X1),one)
& one = join(composition(converse(X0),X0),one) ),
inference(ennf_transformation,[],[f18]) ).
fof(f20,plain,
? [X0,X1] :
( one != join(composition(converse(composition(X0,X1)),composition(X0,X1)),one)
& one = join(composition(converse(X1),X1),one)
& one = join(composition(converse(X0),X0),one) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
( ? [X0,X1] :
( one != join(composition(converse(composition(X0,X1)),composition(X0,X1)),one)
& one = join(composition(converse(X1),X1),one)
& one = join(composition(converse(X0),X0),one) )
=> ( one != join(composition(converse(composition(sK0,sK1)),composition(sK0,sK1)),one)
& one = join(composition(converse(sK1),sK1),one)
& one = join(composition(converse(sK0),sK0),one) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
( one != join(composition(converse(composition(sK0,sK1)),composition(sK0,sK1)),one)
& one = join(composition(converse(sK1),sK1),one)
& one = join(composition(converse(sK0),sK0),one) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f20,f21]) ).
fof(f23,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f24,plain,
! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
inference(cnf_transformation,[],[f2]) ).
fof(f27,plain,
! [X2,X0,X1] : composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f28,plain,
! [X0] : composition(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f29,plain,
! [X2,X0,X1] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
inference(cnf_transformation,[],[f7]) ).
fof(f30,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
fof(f31,plain,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(cnf_transformation,[],[f9]) ).
fof(f32,plain,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f39,plain,
one = join(composition(converse(sK0),sK0),one),
inference(cnf_transformation,[],[f22]) ).
fof(f40,plain,
one = join(composition(converse(sK1),sK1),one),
inference(cnf_transformation,[],[f22]) ).
fof(f41,plain,
one != join(composition(converse(composition(sK0,sK1)),composition(sK0,sK1)),one),
inference(cnf_transformation,[],[f22]) ).
cnf(c_49,plain,
join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f23]) ).
cnf(c_50,plain,
join(join(X0,X1),X2) = join(X0,join(X1,X2)),
inference(cnf_transformation,[],[f24]) ).
cnf(c_52,plain,
composition(composition(X0,X1),X2) = composition(X0,composition(X1,X2)),
inference(cnf_transformation,[],[f27]) ).
cnf(c_53,plain,
composition(X0,one) = X0,
inference(cnf_transformation,[],[f28]) ).
cnf(c_54,plain,
join(composition(X0,X1),composition(X2,X1)) = composition(join(X0,X2),X1),
inference(cnf_transformation,[],[f29]) ).
cnf(c_55,plain,
converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f30]) ).
cnf(c_56,plain,
join(converse(X0),converse(X1)) = converse(join(X0,X1)),
inference(cnf_transformation,[],[f31]) ).
cnf(c_57,plain,
composition(converse(X0),converse(X1)) = converse(composition(X1,X0)),
inference(cnf_transformation,[],[f32]) ).
cnf(c_64,negated_conjecture,
join(composition(converse(composition(sK0,sK1)),composition(sK0,sK1)),one) != one,
inference(cnf_transformation,[],[f41]) ).
cnf(c_65,negated_conjecture,
join(composition(converse(sK1),sK1),one) = one,
inference(cnf_transformation,[],[f40]) ).
cnf(c_66,negated_conjecture,
join(composition(converse(sK0),sK0),one) = one,
inference(cnf_transformation,[],[f39]) ).
cnf(c_86,negated_conjecture,
join(one,composition(converse(composition(sK0,sK1)),composition(sK0,sK1))) != one,
inference(theory_normalisation,[status(thm)],[c_64,c_50,c_49]) ).
cnf(c_87,negated_conjecture,
join(one,composition(converse(sK1),sK1)) = one,
inference(theory_normalisation,[status(thm)],[c_65,c_50,c_49]) ).
cnf(c_88,negated_conjecture,
join(one,composition(converse(sK0),sK0)) = one,
inference(theory_normalisation,[status(thm)],[c_66,c_50,c_49]) ).
cnf(c_238,plain,
converse(composition(converse(X0),X1)) = composition(converse(X1),X0),
inference(superposition,[status(thm)],[c_55,c_57]) ).
cnf(c_243,plain,
join(one,join(composition(converse(sK1),sK1),X0)) = join(one,X0),
inference(superposition,[status(thm)],[c_87,c_50]) ).
cnf(c_353,plain,
composition(X0,composition(one,X1)) = composition(X0,X1),
inference(superposition,[status(thm)],[c_53,c_52]) ).
cnf(c_368,plain,
join(one,composition(join(converse(sK1),X0),sK1)) = join(one,composition(X0,sK1)),
inference(superposition,[status(thm)],[c_54,c_243]) ).
cnf(c_456,plain,
join(one,composition(converse(join(sK1,X0)),sK1)) = join(one,composition(converse(X0),sK1)),
inference(superposition,[status(thm)],[c_56,c_368]) ).
cnf(c_1129,plain,
composition(converse(one),X0) = converse(converse(X0)),
inference(superposition,[status(thm)],[c_53,c_238]) ).
cnf(c_1153,plain,
composition(converse(one),X0) = X0,
inference(light_normalisation,[status(thm)],[c_1129,c_55]) ).
cnf(c_1187,plain,
composition(converse(one),X0) = composition(one,X0),
inference(superposition,[status(thm)],[c_1153,c_353]) ).
cnf(c_1190,plain,
composition(one,X0) = X0,
inference(light_normalisation,[status(thm)],[c_1187,c_1153]) ).
cnf(c_1227,plain,
join(X0,composition(X1,X0)) = composition(join(one,X1),X0),
inference(superposition,[status(thm)],[c_1190,c_54]) ).
cnf(c_6137,plain,
join(X0,composition(composition(converse(sK0),sK0),X0)) = composition(one,X0),
inference(superposition,[status(thm)],[c_88,c_1227]) ).
cnf(c_6235,plain,
join(X0,composition(composition(converse(sK0),sK0),X0)) = X0,
inference(light_normalisation,[status(thm)],[c_6137,c_1190]) ).
cnf(c_6434,plain,
join(X0,composition(converse(sK0),composition(sK0,X0))) = X0,
inference(demodulation,[status(thm)],[c_6235,c_52]) ).
cnf(c_6460,plain,
join(one,composition(converse(composition(converse(sK0),composition(sK0,sK1))),sK1)) = join(one,composition(converse(sK1),sK1)),
inference(superposition,[status(thm)],[c_6434,c_456]) ).
cnf(c_6481,plain,
join(one,composition(converse(composition(converse(sK0),composition(sK0,sK1))),sK1)) = one,
inference(light_normalisation,[status(thm)],[c_6460,c_87]) ).
cnf(c_6538,plain,
join(one,composition(converse(composition(sK0,sK1)),composition(sK0,sK1))) = one,
inference(demodulation,[status(thm)],[c_6481,c_52,c_238]) ).
cnf(c_6539,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6538,c_86]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : REL031+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n014.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri Aug 25 19:02:18 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.57/1.17 % SZS status Started for theBenchmark.p
% 3.57/1.17 % SZS status Theorem for theBenchmark.p
% 3.57/1.17
% 3.57/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.57/1.17
% 3.57/1.17 ------ iProver source info
% 3.57/1.17
% 3.57/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.57/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.57/1.17 git: non_committed_changes: false
% 3.57/1.17 git: last_make_outside_of_git: false
% 3.57/1.17
% 3.57/1.17 ------ Parsing...
% 3.57/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.57/1.17
% 3.57/1.17 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.57/1.17
% 3.57/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.57/1.17
% 3.57/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.57/1.17 ------ Proving...
% 3.57/1.17 ------ Problem Properties
% 3.57/1.17
% 3.57/1.17
% 3.57/1.17 clauses 18
% 3.57/1.17 conjectures 3
% 3.57/1.17 EPR 0
% 3.57/1.17 Horn 18
% 3.57/1.17 unary 18
% 3.57/1.17 binary 0
% 3.57/1.17 lits 18
% 3.57/1.17 lits eq 18
% 3.57/1.17 fd_pure 0
% 3.57/1.17 fd_pseudo 0
% 3.57/1.17 fd_cond 0
% 3.57/1.17 fd_pseudo_cond 0
% 3.57/1.17 AC symbols 1
% 3.57/1.17
% 3.57/1.17 ------ Schedule UEQ
% 3.57/1.17
% 3.57/1.17 ------ Option_UEQ Time Limit: 10.
% 3.57/1.17
% 3.57/1.17
% 3.57/1.17 ------
% 3.57/1.17 Current options:
% 3.57/1.17 ------
% 3.57/1.17
% 3.57/1.17
% 3.57/1.17
% 3.57/1.17
% 3.57/1.17 ------ Proving...
% 3.57/1.17
% 3.57/1.17
% 3.57/1.17 % SZS status Theorem for theBenchmark.p
% 3.57/1.17
% 3.57/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.57/1.17
% 3.57/1.17
%------------------------------------------------------------------------------