TSTP Solution File: REL003+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : REL003+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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:33 EDT 2023
% Result : Theorem 0.93s 1.16s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 19 unt; 0 def)
% Number of atoms : 75 ( 74 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 60 ( 25 ~; 20 |; 10 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn; 20 !; 4 ?)
% 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(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(f14,conjecture,
! [X0,X1] :
( ( converse(X1) = join(converse(X0),converse(X1))
=> join(X0,X1) = X1 )
& ( join(X0,X1) = X1
=> converse(X1) = join(converse(X0),converse(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
( ( converse(X1) = join(converse(X0),converse(X1))
=> join(X0,X1) = X1 )
& ( join(X0,X1) = X1
=> converse(X1) = join(converse(X0),converse(X1)) ) ),
inference(negated_conjecture,[],[f14]) ).
fof(f16,plain,
? [X0,X1] :
( ( join(X0,X1) != X1
& converse(X1) = join(converse(X0),converse(X1)) )
| ( converse(X1) != join(converse(X0),converse(X1))
& join(X0,X1) = X1 ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
( ? [X0,X1] :
( ( join(X0,X1) != X1
& converse(X1) = join(converse(X0),converse(X1)) )
| ( converse(X1) != join(converse(X0),converse(X1))
& join(X0,X1) = X1 ) )
=> ( ( sK1 != join(sK0,sK1)
& converse(sK1) = join(converse(sK0),converse(sK1)) )
| ( converse(sK1) != join(converse(sK0),converse(sK1))
& sK1 = join(sK0,sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( ( sK1 != join(sK0,sK1)
& converse(sK1) = join(converse(sK0),converse(sK1)) )
| ( converse(sK1) != join(converse(sK0),converse(sK1))
& sK1 = join(sK0,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[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(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(f32,plain,
( converse(sK1) = join(converse(sK0),converse(sK1))
| sK1 = join(sK0,sK1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f35,plain,
( sK1 != join(sK0,sK1)
| converse(sK1) != join(converse(sK0),converse(sK1)) ),
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_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_61,negated_conjecture,
( join(converse(sK0),converse(sK1)) != converse(sK1)
| join(sK0,sK1) != sK1 ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_62,negated_conjecture,
( join(converse(sK0),converse(sK1)) = converse(sK1)
| join(sK0,sK1) = sK1 ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_77,negated_conjecture,
( join(converse(sK1),converse(sK0)) != converse(sK1)
| join(sK1,sK0) != sK1 ),
inference(theory_normalisation,[status(thm)],[c_61,c_50,c_49]) ).
cnf(c_78,negated_conjecture,
( join(converse(sK1),converse(sK0)) = converse(sK1)
| join(sK1,sK0) = sK1 ),
inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).
cnf(c_79,plain,
( join(sK1,sK0) != sK1
| join(converse(sK1),converse(sK0)) != converse(sK1) ),
inference(prop_impl_just,[status(thm)],[c_77]) ).
cnf(c_80,plain,
( join(converse(sK1),converse(sK0)) != converse(sK1)
| join(sK1,sK0) != sK1 ),
inference(renaming,[status(thm)],[c_79]) ).
cnf(c_81,plain,
( join(sK1,sK0) = sK1
| join(converse(sK1),converse(sK0)) = converse(sK1) ),
inference(prop_impl_just,[status(thm)],[c_78]) ).
cnf(c_82,plain,
( join(converse(sK1),converse(sK0)) = converse(sK1)
| join(sK1,sK0) = sK1 ),
inference(renaming,[status(thm)],[c_81]) ).
cnf(c_136,plain,
( converse(join(sK1,sK0)) = converse(sK1)
| join(sK1,sK0) = sK1 ),
inference(ac_demodulation,[status(thm)],[c_82,c_56,c_50,c_49]) ).
cnf(c_139,plain,
( converse(join(sK1,sK0)) != converse(sK1)
| join(sK1,sK0) != sK1 ),
inference(ac_demodulation,[status(thm)],[c_80,c_56,c_50,c_49]) ).
cnf(c_155,plain,
( X0 != X1
| converse(X0) = converse(X1) ),
theory(equality) ).
cnf(c_162,plain,
( join(sK1,sK0) = sK1
| converse(join(sK1,sK0)) = converse(sK1) ),
inference(prop_impl_just,[status(thm)],[c_136]) ).
cnf(c_163,plain,
( converse(join(sK1,sK0)) = converse(sK1)
| join(sK1,sK0) = sK1 ),
inference(renaming,[status(thm)],[c_162]) ).
cnf(c_166,plain,
( X0 != X1
| converse(X0) = converse(X1) ),
inference(prop_impl_just,[status(thm)],[c_155]) ).
cnf(c_232,plain,
converse(join(sK1,sK0)) = converse(sK1),
inference(backward_subsumption_resolution,[status(thm)],[c_163,c_166]) ).
cnf(c_567,plain,
converse(join(sK1,sK0)) = converse(sK1),
inference(global_subsumption_just,[status(thm)],[c_136,c_232]) ).
cnf(c_573,plain,
join(sK1,sK0) = converse(converse(sK1)),
inference(superposition,[status(thm)],[c_567,c_55]) ).
cnf(c_614,plain,
join(sK1,sK0) = sK1,
inference(demodulation,[status(thm)],[c_573,c_55]) ).
cnf(c_883,plain,
join(sK1,sK0) != sK1,
inference(global_subsumption_just,[status(thm)],[c_139,c_139,c_232]) ).
cnf(c_885,plain,
sK1 != sK1,
inference(demodulation,[status(thm)],[c_883,c_614]) ).
cnf(c_886,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_885]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : REL003+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 25 21:40:29 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.93/1.16 % SZS status Started for theBenchmark.p
% 0.93/1.16 % SZS status Theorem for theBenchmark.p
% 0.93/1.16
% 0.93/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.93/1.16
% 0.93/1.16 ------ iProver source info
% 0.93/1.16
% 0.93/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.93/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.93/1.16 git: non_committed_changes: false
% 0.93/1.16 git: last_make_outside_of_git: false
% 0.93/1.16
% 0.93/1.16 ------ Parsing...
% 0.93/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.93/1.16
% 0.93/1.16 ------ Preprocessing... sup_sim: 3 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.93/1.16
% 0.93/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.93/1.16
% 0.93/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.93/1.16 ------ Proving...
% 0.93/1.16 ------ Problem Properties
% 0.93/1.16
% 0.93/1.16
% 0.93/1.16 clauses 14
% 0.93/1.16 conjectures 0
% 0.93/1.16 EPR 0
% 0.93/1.16 Horn 13
% 0.93/1.16 unary 12
% 0.93/1.16 binary 2
% 0.93/1.16 lits 16
% 0.93/1.16 lits eq 16
% 0.93/1.16 fd_pure 0
% 0.93/1.16 fd_pseudo 0
% 0.93/1.16 fd_cond 0
% 0.93/1.16 fd_pseudo_cond 0
% 0.93/1.16 AC symbols 1
% 0.93/1.16
% 0.93/1.16 ------ Schedule dynamic 5 is on
% 0.93/1.16
% 0.93/1.16 ------ no conjectures: strip conj schedule
% 0.93/1.16
% 0.93/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.93/1.16
% 0.93/1.16
% 0.93/1.16 ------
% 0.93/1.16 Current options:
% 0.93/1.16 ------
% 0.93/1.16
% 0.93/1.16
% 0.93/1.16
% 0.93/1.16
% 0.93/1.16 ------ Proving...
% 0.93/1.16
% 0.93/1.16
% 0.93/1.16 % SZS status Theorem for theBenchmark.p
% 0.93/1.16
% 0.93/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.93/1.16
% 0.93/1.16
%------------------------------------------------------------------------------