TSTP Solution File: GRP140-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : GRP140-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n008.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:19:31 EDT 2024
% Result : Unsatisfiable 5.83s 1.08s
% Output : CNFRefutation 5.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 50 ( 50 unt; 0 def)
% Number of atoms : 50 ( 49 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 98 ( 98 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X,Y] : greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X,Y] : least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X,Y,Z] : greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y,Z] : least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X,Y] : least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X,Y] : greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,hypothesis,
greatest_lower_bound(a,c) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,hypothesis,
greatest_lower_bound(b,c) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f22,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f23,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f24,plain,
! [X0,X1,X2] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f25,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f28,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f29,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f34,plain,
greatest_lower_bound(a,c) = c,
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f35,plain,
greatest_lower_bound(b,c) = c,
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f36,plain,
least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f37,plain,
greatest_lower_bound(c,b) = c,
inference(forward_demodulation,[status(thm)],[f22,f35]) ).
fof(f38,plain,
least_upper_bound(c,greatest_lower_bound(a,b)) != greatest_lower_bound(a,b),
inference(forward_demodulation,[status(thm)],[f23,f36]) ).
fof(f43,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f22,f28]) ).
fof(f51,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f23,f29]) ).
fof(f53,plain,
! [X0,X1] : greatest_lower_bound(greatest_lower_bound(X0,X1),X1) = greatest_lower_bound(X0,X1),
inference(paramodulation,[status(thm)],[f43,f51]) ).
fof(f54,plain,
! [X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X0)) = greatest_lower_bound(X1,X0),
inference(forward_demodulation,[status(thm)],[f22,f53]) ).
fof(f171,plain,
! [X0,X1,X2] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X2,greatest_lower_bound(X0,X1)),
inference(paramodulation,[status(thm)],[f22,f24]) ).
fof(f203,plain,
! [X0,X1,X2] : least_upper_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,X0))) = X0,
inference(paramodulation,[status(thm)],[f24,f43]) ).
fof(f206,plain,
! [X0,X1,X2] : least_upper_bound(greatest_lower_bound(X0,X1),greatest_lower_bound(X0,greatest_lower_bound(X1,X2))) = greatest_lower_bound(X0,X1),
inference(paramodulation,[status(thm)],[f24,f28]) ).
fof(f226,plain,
! [X0,X1,X2] : least_upper_bound(least_upper_bound(X0,X1),greatest_lower_bound(X2,X0)) = least_upper_bound(X0,X1),
inference(paramodulation,[status(thm)],[f29,f203]) ).
fof(f227,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,greatest_lower_bound(X2,X0))) = least_upper_bound(X0,X1),
inference(forward_demodulation,[status(thm)],[f25,f226]) ).
fof(f251,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X2,least_upper_bound(X0,X1)),
inference(paramodulation,[status(thm)],[f23,f25]) ).
fof(f266,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(greatest_lower_bound(X0,X1),X2)) = least_upper_bound(X0,X2),
inference(paramodulation,[status(thm)],[f28,f25]) ).
fof(f553,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,greatest_lower_bound(X0,X2))) = least_upper_bound(X0,X1),
inference(paramodulation,[status(thm)],[f22,f227]) ).
fof(f1050,plain,
! [X0,X1,X2] : least_upper_bound(greatest_lower_bound(X0,X1),greatest_lower_bound(X1,greatest_lower_bound(X2,X0))) = greatest_lower_bound(X0,X1),
inference(paramodulation,[status(thm)],[f171,f43]) ).
fof(f1446,plain,
! [X0,X1,X2,X3] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X2,greatest_lower_bound(X1,X3)),least_upper_bound(X0,X1)),
inference(paramodulation,[status(thm)],[f553,f251]) ).
fof(f1447,plain,
! [X0,X1,X2,X3] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X2,least_upper_bound(greatest_lower_bound(X1,X3),least_upper_bound(X0,X1))),
inference(forward_demodulation,[status(thm)],[f25,f1446]) ).
fof(f1448,plain,
! [X0,X1,X2,X3] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X2,least_upper_bound(X1,least_upper_bound(greatest_lower_bound(X1,X3),X0))),
inference(forward_demodulation,[status(thm)],[f251,f1447]) ).
fof(f1449,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X2,least_upper_bound(X1,X0)),
inference(forward_demodulation,[status(thm)],[f266,f1448]) ).
fof(f2842,plain,
! [X0,X1] : least_upper_bound(greatest_lower_bound(X0,X1),greatest_lower_bound(X1,X0)) = greatest_lower_bound(X0,X1),
inference(paramodulation,[status(thm)],[f54,f206]) ).
fof(f3142,plain,
! [X0,X1,X2] : least_upper_bound(greatest_lower_bound(X0,X1),least_upper_bound(greatest_lower_bound(X1,X0),X2)) = least_upper_bound(X2,greatest_lower_bound(X1,X0)),
inference(paramodulation,[status(thm)],[f2842,f1449]) ).
fof(f3152,plain,
! [X0,X1,X2] : least_upper_bound(greatest_lower_bound(X0,X1),least_upper_bound(greatest_lower_bound(X1,X0),X2)) = least_upper_bound(X2,greatest_lower_bound(X0,X1)),
inference(paramodulation,[status(thm)],[f2842,f251]) ).
fof(f3153,plain,
! [X0,X1,X2] : least_upper_bound(X0,greatest_lower_bound(X1,X2)) = least_upper_bound(X0,greatest_lower_bound(X2,X1)),
inference(forward_demodulation,[status(thm)],[f3142,f3152]) ).
fof(f3181,plain,
! [X0,X1,X2] : least_upper_bound(greatest_lower_bound(X0,X1),least_upper_bound(greatest_lower_bound(X1,X0),X2)) = least_upper_bound(greatest_lower_bound(X0,X1),X2),
inference(paramodulation,[status(thm)],[f2842,f25]) ).
fof(f3182,plain,
! [X0,X1,X2] : least_upper_bound(X0,greatest_lower_bound(X1,X2)) = least_upper_bound(greatest_lower_bound(X2,X1),X0),
inference(forward_demodulation,[status(thm)],[f3142,f3181]) ).
fof(f4333,plain,
! [X0] : least_upper_bound(greatest_lower_bound(b,X0),greatest_lower_bound(X0,c)) = greatest_lower_bound(b,X0),
inference(paramodulation,[status(thm)],[f37,f1050]) ).
fof(f4334,plain,
! [X0] : least_upper_bound(greatest_lower_bound(c,X0),greatest_lower_bound(b,X0)) = greatest_lower_bound(b,X0),
inference(forward_demodulation,[status(thm)],[f3182,f4333]) ).
fof(f6338,plain,
! [X0] : least_upper_bound(greatest_lower_bound(X0,c),greatest_lower_bound(b,X0)) = greatest_lower_bound(b,X0),
inference(paramodulation,[status(thm)],[f22,f4334]) ).
fof(f6688,plain,
least_upper_bound(c,greatest_lower_bound(b,a)) = greatest_lower_bound(b,a),
inference(paramodulation,[status(thm)],[f34,f6338]) ).
fof(f6689,plain,
least_upper_bound(c,greatest_lower_bound(a,b)) = greatest_lower_bound(b,a),
inference(forward_demodulation,[status(thm)],[f3153,f6688]) ).
fof(f6690,plain,
least_upper_bound(c,greatest_lower_bound(a,b)) = greatest_lower_bound(a,b),
inference(forward_demodulation,[status(thm)],[f22,f6689]) ).
fof(f6691,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f6690,f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP140-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.06/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.33 % Computer : n008.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Apr 30 00:20:42 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.34 % Drodi V3.6.0
% 5.83/1.08 % Refutation found
% 5.83/1.08 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 5.83/1.08 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 5.97/1.12 % Elapsed time: 0.773288 seconds
% 5.97/1.12 % CPU time: 6.005909 seconds
% 5.97/1.12 % Total memory used: 96.914 MB
% 5.97/1.12 % Net memory used: 95.773 MB
%------------------------------------------------------------------------------