TSTP Solution File: GRP143-1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : GRP143-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n029.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:12 EDT 2022
% Result : Unsatisfiable 2.26s 2.51s
% Output : Refutation 2.26s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named eq_axiom)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_ax_glb2b,negated_conjecture,
greatest_lower_bound(greatest_lower_bound(a,b),a) != greatest_lower_bound(a,b),
input ).
cnf(symmetry,axiom,
( X6 != X7
| X7 = X6 ),
eq_axiom ).
cnf(associativity_of_glb,axiom,
greatest_lower_bound(X25,greatest_lower_bound(X26,X27)) = greatest_lower_bound(greatest_lower_bound(X25,X26),X27),
input ).
cnf(transitivity,axiom,
( X47 != X48
| X48 != X49
| X47 = X49 ),
eq_axiom ).
cnf(c33,plain,
( X226 != greatest_lower_bound(X227,greatest_lower_bound(X225,X228))
| X226 = greatest_lower_bound(greatest_lower_bound(X227,X225),X228) ),
inference(resolution,status(thm),[transitivity,associativity_of_glb]) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X19,X20) = greatest_lower_bound(X20,X19),
input ).
cnf(c25,plain,
( X175 != greatest_lower_bound(X176,X177)
| X175 = greatest_lower_bound(X177,X176) ),
inference(resolution,status(thm),[transitivity,symmetry_of_glb]) ).
cnf(idempotence_of_gld,axiom,
greatest_lower_bound(X4,X4) = X4,
input ).
cnf(c6,plain,
X10 = greatest_lower_bound(X10,X10),
inference(resolution,status(thm),[symmetry,idempotence_of_gld]) ).
cnf(reflexivity,axiom,
X2 = X2,
eq_axiom ).
cnf(c2,plain,
( X110 != X109
| X108 != X111
| greatest_lower_bound(X110,X108) = greatest_lower_bound(X109,X111) ),
eq_axiom ).
cnf(c252,plain,
( X627 != X626
| greatest_lower_bound(X627,X625) = greatest_lower_bound(X626,X625) ),
inference(resolution,status(thm),[c2,reflexivity]) ).
cnf(c2692,plain,
greatest_lower_bound(X636,X635) = greatest_lower_bound(greatest_lower_bound(X636,X636),X635),
inference(resolution,status(thm),[c252,c6]) ).
cnf(c2799,plain,
greatest_lower_bound(X670,X671) = greatest_lower_bound(X671,greatest_lower_bound(X670,X670)),
inference(resolution,status(thm),[c2692,c25]) ).
cnf(c3096,plain,
greatest_lower_bound(X719,X718) = greatest_lower_bound(greatest_lower_bound(X718,X719),X719),
inference(resolution,status(thm),[c2799,c33]) ).
cnf(c3387,plain,
greatest_lower_bound(X786,X785) = greatest_lower_bound(X786,greatest_lower_bound(X785,X786)),
inference(resolution,status(thm),[c3096,c25]) ).
cnf(c4069,plain,
greatest_lower_bound(X861,X860) = greatest_lower_bound(greatest_lower_bound(X861,X860),X861),
inference(resolution,status(thm),[c3387,c33]) ).
cnf(c5453,plain,
greatest_lower_bound(greatest_lower_bound(X922,X923),X922) = greatest_lower_bound(X922,X923),
inference(resolution,status(thm),[c4069,symmetry]) ).
cnf(c6679,plain,
$false,
inference(resolution,status(thm),[c5453,prove_ax_glb2b]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP143-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.34 % Computer : n029.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 : 600
% 0.12/0.34 % DateTime : Mon Jun 13 04:47:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.26/2.51 # Version: 1.3
% 2.26/2.51 # SZS status Unsatisfiable
% 2.26/2.51 # SZS output start CNFRefutation
% See solution above
% 2.26/2.51
% 2.26/2.51 # Initial clauses : 23
% 2.26/2.51 # Processed clauses : 256
% 2.26/2.51 # Factors computed : 0
% 2.26/2.51 # Resolvents computed: 6676
% 2.26/2.51 # Tautologies deleted: 1
% 2.26/2.51 # Forward subsumed : 311
% 2.26/2.51 # Backward subsumed : 3
% 2.26/2.51 # -------- CPU Time ---------
% 2.26/2.51 # User time : 2.140 s
% 2.26/2.51 # System time : 0.022 s
% 2.26/2.51 # Total time : 2.162 s
%------------------------------------------------------------------------------