TSTP Solution File: REL049+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : REL049+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:41:09 EDT 2023
% Result : Theorem 1.69s 1.16s
% Output : CNFRefutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 17 unt; 0 def)
% Number of atoms : 38 ( 37 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 25 ( 10 ~; 0 |; 12 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn; 16 !; 9 ?)
% 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(f14,conjecture,
! [X0,X1,X2] :
( ( join(X2,X1) = X1
& join(X0,X1) = X1 )
=> join(join(X0,X2),X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0,X1,X2] :
( ( join(X2,X1) = X1
& join(X0,X1) = X1 )
=> join(join(X0,X2),X1) = X1 ),
inference(negated_conjecture,[],[f14]) ).
fof(f16,plain,
? [X0,X1,X2] :
( join(join(X0,X2),X1) != X1
& join(X2,X1) = X1
& join(X0,X1) = X1 ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
? [X0,X1,X2] :
( join(join(X0,X2),X1) != X1
& join(X2,X1) = X1
& join(X0,X1) = X1 ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
( ? [X0,X1,X2] :
( join(join(X0,X2),X1) != X1
& join(X2,X1) = X1
& join(X0,X1) = X1 )
=> ( sK1 != join(join(sK0,sK2),sK1)
& sK1 = join(sK2,sK1)
& sK1 = join(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
( sK1 != join(join(sK0,sK2),sK1)
& sK1 = join(sK2,sK1)
& sK1 = join(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f17,f18]) ).
fof(f20,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f21,plain,
! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
inference(cnf_transformation,[],[f2]) ).
fof(f33,plain,
sK1 = join(sK0,sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f34,plain,
sK1 = join(sK2,sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f35,plain,
sK1 != join(join(sK0,sK2),sK1),
inference(cnf_transformation,[],[f19]) ).
cnf(c_49,plain,
join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f20]) ).
cnf(c_50,plain,
join(join(X0,X1),X2) = join(X0,join(X1,X2)),
inference(cnf_transformation,[],[f21]) ).
cnf(c_61,negated_conjecture,
join(join(sK0,sK2),sK1) != sK1,
inference(cnf_transformation,[],[f35]) ).
cnf(c_62,negated_conjecture,
join(sK2,sK1) = sK1,
inference(cnf_transformation,[],[f34]) ).
cnf(c_63,negated_conjecture,
join(sK0,sK1) = sK1,
inference(cnf_transformation,[],[f33]) ).
cnf(c_78,negated_conjecture,
join(sK1,join(sK0,sK2)) != sK1,
inference(theory_normalisation,[status(thm)],[c_61,c_50,c_49]) ).
cnf(c_79,negated_conjecture,
join(sK1,sK2) = sK1,
inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).
cnf(c_80,negated_conjecture,
join(sK1,sK0) = sK1,
inference(theory_normalisation,[status(thm)],[c_63,c_50,c_49]) ).
cnf(c_113,plain,
join(sK0,sK1) != sK1,
inference(ac_demodulation,[status(thm)],[c_78,c_79,c_50,c_49]) ).
cnf(c_114,plain,
$false,
inference(ac_demodulation,[status(thm)],[c_113,c_80,c_50,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : REL049+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 25 22:40:07 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.69/1.16 % SZS status Started for theBenchmark.p
% 1.69/1.16 % SZS status Theorem for theBenchmark.p
% 1.69/1.16
% 1.69/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.69/1.16
% 1.69/1.16 ------ iProver source info
% 1.69/1.16
% 1.69/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.69/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.69/1.16 git: non_committed_changes: false
% 1.69/1.16 git: last_make_outside_of_git: false
% 1.69/1.16
% 1.69/1.16 ------ Parsing...
% 1.69/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.69/1.16
% 1.69/1.16 ------ Preprocessing...
% 1.69/1.16
% 1.69/1.16 % SZS status Theorem for theBenchmark.p
% 1.69/1.16
% 1.69/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.69/1.16
% 1.69/1.16
%------------------------------------------------------------------------------