TSTP Solution File: GRP150-1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : GRP150-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n025.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 : 600s
% DateTime : Sat Jul 16 11:22:13 EDT 2022
% Result : Unsatisfiable 4.65s 4.81s
% Output : Refutation 4.65s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named eq_axiom)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_ax_lub2a,negated_conjecture,
least_upper_bound(a,least_upper_bound(a,b)) != least_upper_bound(a,b),
input ).
cnf(symmetry,axiom,
( X7 != X6
| X6 = X7 ),
eq_axiom ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X22,X21) = least_upper_bound(X21,X22),
input ).
cnf(transitivity,axiom,
( X49 != X48
| X48 != X47
| X49 = X47 ),
eq_axiom ).
cnf(c35,plain,
( X220 != least_upper_bound(X222,X221)
| X220 = least_upper_bound(X221,X222) ),
inference(resolution,status(thm),[transitivity,symmetry_of_lub]) ).
cnf(associativity_of_lub,axiom,
least_upper_bound(X39,least_upper_bound(X38,X37)) = least_upper_bound(least_upper_bound(X39,X38),X37),
input ).
cnf(c23,plain,
( X152 != least_upper_bound(X155,least_upper_bound(X154,X153))
| X152 = least_upper_bound(least_upper_bound(X155,X154),X153) ),
inference(resolution,status(thm),[transitivity,associativity_of_lub]) ).
cnf(idempotence_of_lub,axiom,
least_upper_bound(X3,X3) = X3,
input ).
cnf(c5,plain,
X11 = least_upper_bound(X11,X11),
inference(resolution,status(thm),[symmetry,idempotence_of_lub]) ).
cnf(reflexivity,axiom,
X2 = X2,
eq_axiom ).
cnf(c3,plain,
( X118 != X119
| X120 != X117
| least_upper_bound(X118,X120) = least_upper_bound(X119,X117) ),
eq_axiom ).
cnf(c298,plain,
( X1080 != X1078
| least_upper_bound(X1080,X1079) = least_upper_bound(X1078,X1079) ),
inference(resolution,status(thm),[c3,reflexivity]) ).
cnf(c9831,plain,
least_upper_bound(X1089,X1090) = least_upper_bound(least_upper_bound(X1089,X1089),X1090),
inference(resolution,status(thm),[c298,c5]) ).
cnf(c10214,plain,
least_upper_bound(X1126,X1127) = least_upper_bound(X1127,least_upper_bound(X1126,X1126)),
inference(resolution,status(thm),[c9831,c35]) ).
cnf(c11210,plain,
least_upper_bound(X1188,X1189) = least_upper_bound(least_upper_bound(X1189,X1188),X1188),
inference(resolution,status(thm),[c10214,c23]) ).
cnf(c12600,plain,
least_upper_bound(X1257,X1258) = least_upper_bound(X1257,least_upper_bound(X1258,X1257)),
inference(resolution,status(thm),[c11210,c35]) ).
cnf(c14082,plain,
least_upper_bound(X1326,X1327) = least_upper_bound(least_upper_bound(X1326,X1327),X1326),
inference(resolution,status(thm),[c12600,c23]) ).
cnf(c14799,plain,
least_upper_bound(X1382,X1381) = least_upper_bound(X1382,least_upper_bound(X1382,X1381)),
inference(resolution,status(thm),[c14082,c35]) ).
cnf(c15349,plain,
least_upper_bound(X1412,least_upper_bound(X1412,X1413)) = least_upper_bound(X1412,X1413),
inference(resolution,status(thm),[c14799,symmetry]) ).
cnf(c16000,plain,
$false,
inference(resolution,status(thm),[c15349,prove_ax_lub2a]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP150-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 06:15:09 EDT 2022
% 0.14/0.34 % CPUTime :
% 4.65/4.81 # Version: 1.3
% 4.65/4.81 # SZS status Unsatisfiable
% 4.65/4.81 # SZS output start CNFRefutation
% See solution above
% 4.65/4.81
% 4.65/4.81 # Initial clauses : 23
% 4.65/4.81 # Processed clauses : 371
% 4.65/4.81 # Factors computed : 0
% 4.65/4.81 # Resolvents computed: 16036
% 4.65/4.81 # Tautologies deleted: 1
% 4.65/4.81 # Forward subsumed : 490
% 4.65/4.81 # Backward subsumed : 6
% 4.65/4.81 # -------- CPU Time ---------
% 4.65/4.81 # User time : 4.426 s
% 4.65/4.81 # System time : 0.039 s
% 4.65/4.81 # Total time : 4.465 s
%------------------------------------------------------------------------------