TSTP Solution File: GEO084+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : GEO084+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 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 : Tue Apr 30 20:17:03 EDT 2024
% Result : Theorem 0.10s 0.38s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 37 ( 10 unt; 0 def)
% Number of atoms : 130 ( 8 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 146 ( 53 ~; 51 |; 34 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 79 ( 67 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [C,C1] :
( part_of(C1,C)
<=> ! [P] :
( incident_c(P,C1)
=> incident_c(P,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [C,C1,C2] :
( C = sum(C1,C2)
<=> ! [Q] :
( incident_c(Q,C)
<=> ( incident_c(Q,C1)
| incident_c(Q,C2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,conjecture,
! [C1,C2,C3,P] :
( ( part_of(C1,C3)
& part_of(C2,C3)
& meet(P,C1,C2) )
=> part_of(sum(C1,C2),C3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
~ ! [C1,C2,C3,P] :
( ( part_of(C1,C3)
& part_of(C2,C3)
& meet(P,C1,C2) )
=> part_of(sum(C1,C2),C3) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
! [C,C1] :
( part_of(C1,C)
<=> ! [P] :
( ~ incident_c(P,C1)
| incident_c(P,C) ) ),
inference(pre_NNF_transformation,[status(esa)],[f1]) ).
fof(f20,plain,
! [C,C1] :
( ( ~ part_of(C1,C)
| ! [P] :
( ~ incident_c(P,C1)
| incident_c(P,C) ) )
& ( part_of(C1,C)
| ? [P] :
( incident_c(P,C1)
& ~ incident_c(P,C) ) ) ),
inference(NNF_transformation,[status(esa)],[f19]) ).
fof(f21,plain,
( ! [C,C1] :
( ~ part_of(C1,C)
| ! [P] :
( ~ incident_c(P,C1)
| incident_c(P,C) ) )
& ! [C,C1] :
( part_of(C1,C)
| ? [P] :
( incident_c(P,C1)
& ~ incident_c(P,C) ) ) ),
inference(miniscoping,[status(esa)],[f20]) ).
fof(f22,plain,
( ! [C,C1] :
( ~ part_of(C1,C)
| ! [P] :
( ~ incident_c(P,C1)
| incident_c(P,C) ) )
& ! [C,C1] :
( part_of(C1,C)
| ( incident_c(sk0_0(C1,C),C1)
& ~ incident_c(sk0_0(C1,C),C) ) ) ),
inference(skolemization,[status(esa)],[f21]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ~ part_of(X0,X1)
| ~ incident_c(X2,X0)
| incident_c(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( part_of(X0,X1)
| incident_c(sk0_0(X0,X1),X0) ),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f25,plain,
! [X0,X1] :
( part_of(X0,X1)
| ~ incident_c(sk0_0(X0,X1),X1) ),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f26,plain,
! [C,C1,C2] :
( ( C != sum(C1,C2)
| ! [Q] :
( ( ~ incident_c(Q,C)
| incident_c(Q,C1)
| incident_c(Q,C2) )
& ( incident_c(Q,C)
| ( ~ incident_c(Q,C1)
& ~ incident_c(Q,C2) ) ) ) )
& ( C = sum(C1,C2)
| ? [Q] :
( ( ~ incident_c(Q,C)
| ( ~ incident_c(Q,C1)
& ~ incident_c(Q,C2) ) )
& ( incident_c(Q,C)
| incident_c(Q,C1)
| incident_c(Q,C2) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f2]) ).
fof(f27,plain,
( ! [C,C1,C2] :
( C != sum(C1,C2)
| ( ! [Q] :
( ~ incident_c(Q,C)
| incident_c(Q,C1)
| incident_c(Q,C2) )
& ! [Q] :
( incident_c(Q,C)
| ( ~ incident_c(Q,C1)
& ~ incident_c(Q,C2) ) ) ) )
& ! [C,C1,C2] :
( C = sum(C1,C2)
| ? [Q] :
( ( ~ incident_c(Q,C)
| ( ~ incident_c(Q,C1)
& ~ incident_c(Q,C2) ) )
& ( incident_c(Q,C)
| incident_c(Q,C1)
| incident_c(Q,C2) ) ) ) ),
inference(miniscoping,[status(esa)],[f26]) ).
fof(f28,plain,
( ! [C,C1,C2] :
( C != sum(C1,C2)
| ( ! [Q] :
( ~ incident_c(Q,C)
| incident_c(Q,C1)
| incident_c(Q,C2) )
& ! [Q] :
( incident_c(Q,C)
| ( ~ incident_c(Q,C1)
& ~ incident_c(Q,C2) ) ) ) )
& ! [C,C1,C2] :
( C = sum(C1,C2)
| ( ( ~ incident_c(sk0_1(C2,C1,C),C)
| ( ~ incident_c(sk0_1(C2,C1,C),C1)
& ~ incident_c(sk0_1(C2,C1,C),C2) ) )
& ( incident_c(sk0_1(C2,C1,C),C)
| incident_c(sk0_1(C2,C1,C),C1)
| incident_c(sk0_1(C2,C1,C),C2) ) ) ) ),
inference(skolemization,[status(esa)],[f27]) ).
fof(f29,plain,
! [X0,X1,X2,X3] :
( X0 != sum(X1,X2)
| ~ incident_c(X3,X0)
| incident_c(X3,X1)
| incident_c(X3,X2) ),
inference(cnf_transformation,[status(esa)],[f28]) ).
fof(f104,plain,
? [C1,C2,C3,P] :
( part_of(C1,C3)
& part_of(C2,C3)
& meet(P,C1,C2)
& ~ part_of(sum(C1,C2),C3) ),
inference(pre_NNF_transformation,[status(esa)],[f18]) ).
fof(f105,plain,
? [C1,C2,C3] :
( part_of(C1,C3)
& part_of(C2,C3)
& ? [P] : meet(P,C1,C2)
& ~ part_of(sum(C1,C2),C3) ),
inference(miniscoping,[status(esa)],[f104]) ).
fof(f106,plain,
( part_of(sk0_13,sk0_15)
& part_of(sk0_14,sk0_15)
& meet(sk0_16,sk0_13,sk0_14)
& ~ part_of(sum(sk0_13,sk0_14),sk0_15) ),
inference(skolemization,[status(esa)],[f105]) ).
fof(f107,plain,
part_of(sk0_13,sk0_15),
inference(cnf_transformation,[status(esa)],[f106]) ).
fof(f108,plain,
part_of(sk0_14,sk0_15),
inference(cnf_transformation,[status(esa)],[f106]) ).
fof(f110,plain,
~ part_of(sum(sk0_13,sk0_14),sk0_15),
inference(cnf_transformation,[status(esa)],[f106]) ).
fof(f111,plain,
! [X0,X1,X2] :
( ~ incident_c(X0,sum(X1,X2))
| incident_c(X0,X1)
| incident_c(X0,X2) ),
inference(destructive_equality_resolution,[status(esa)],[f29]) ).
fof(f143,plain,
~ incident_c(sk0_0(sum(sk0_13,sk0_14),sk0_15),sk0_15),
inference(resolution,[status(thm)],[f25,f110]) ).
fof(f175,plain,
! [X0] :
( ~ part_of(X0,sk0_15)
| ~ incident_c(sk0_0(sum(sk0_13,sk0_14),sk0_15),X0) ),
inference(resolution,[status(thm)],[f143,f23]) ).
fof(f196,plain,
~ incident_c(sk0_0(sum(sk0_13,sk0_14),sk0_15),sk0_14),
inference(resolution,[status(thm)],[f175,f108]) ).
fof(f197,plain,
~ incident_c(sk0_0(sum(sk0_13,sk0_14),sk0_15),sk0_13),
inference(resolution,[status(thm)],[f175,f107]) ).
fof(f218,plain,
! [X0] :
( ~ incident_c(sk0_0(sum(sk0_13,sk0_14),sk0_15),sum(X0,sk0_14))
| incident_c(sk0_0(sum(sk0_13,sk0_14),sk0_15),X0) ),
inference(resolution,[status(thm)],[f196,f111]) ).
fof(f274,plain,
( spl0_20
<=> incident_c(sk0_0(sum(sk0_13,sk0_14),sk0_15),sum(sk0_13,sk0_14)) ),
introduced(split_symbol_definition) ).
fof(f275,plain,
( incident_c(sk0_0(sum(sk0_13,sk0_14),sk0_15),sum(sk0_13,sk0_14))
| ~ spl0_20 ),
inference(component_clause,[status(thm)],[f274]) ).
fof(f276,plain,
( ~ incident_c(sk0_0(sum(sk0_13,sk0_14),sk0_15),sum(sk0_13,sk0_14))
| spl0_20 ),
inference(component_clause,[status(thm)],[f274]) ).
fof(f291,plain,
( part_of(sum(sk0_13,sk0_14),sk0_15)
| spl0_20 ),
inference(resolution,[status(thm)],[f276,f24]) ).
fof(f292,plain,
( $false
| spl0_20 ),
inference(forward_subsumption_resolution,[status(thm)],[f291,f110]) ).
fof(f293,plain,
spl0_20,
inference(contradiction_clause,[status(thm)],[f292]) ).
fof(f469,plain,
~ incident_c(sk0_0(sum(sk0_13,sk0_14),sk0_15),sum(sk0_13,sk0_14)),
inference(resolution,[status(thm)],[f218,f197]) ).
fof(f470,plain,
( $false
| ~ spl0_20 ),
inference(forward_subsumption_resolution,[status(thm)],[f469,f275]) ).
fof(f471,plain,
~ spl0_20,
inference(contradiction_clause,[status(thm)],[f470]) ).
fof(f472,plain,
$false,
inference(sat_refutation,[status(thm)],[f293,f471]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : GEO084+1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.32 % Computer : n003.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Apr 30 01:39:03 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.33 % Drodi V3.6.0
% 0.10/0.38 % Refutation found
% 0.10/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.38 % Elapsed time: 0.058805 seconds
% 0.10/0.38 % CPU time: 0.355458 seconds
% 0.10/0.38 % Total memory used: 55.829 MB
% 0.10/0.38 % Net memory used: 55.549 MB
%------------------------------------------------------------------------------