TSTP Solution File: GRP146-1 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP146-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n017.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 12:24:57 EDT 2022
% Result : Unsatisfiable 0.60s 0.99s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP146-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : woody %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 20:13:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.60/0.99 ********************************************************************************
% 0.60/0.99 * W A L D M E I S T E R \| \ / \|/ *
% 0.60/0.99 * |/ | \/ | *
% 0.60/0.99 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.60/0.99 * A. Jaeger and B. Loechner | | *
% 0.60/0.99 * <waldmeister@informatik.uni-kl.de> | *
% 0.60/0.99 ********************************************************************************
% 0.60/0.99
% 0.60/0.99
% 0.60/0.99 Goals:
% 0.60/0.99 ------
% 0.60/0.99
% 0.60/0.99 ( 1) least_upper_bound(least_upper_bound(a,b),c) ?=? c
% 0.60/0.99
% 0.60/0.99 Detected structure: VerbandsgeordneteGruppe
% 0.60/0.99 ********************************************************************************
% 0.60/0.99 ****************************** COMPLETION - PROOF ******************************
% 0.60/0.99 ********************************************************************************
% 0.60/0.99
% 0.60/0.99 joined goal: 1 least_upper_bound(least_upper_bound(a,b),c) ?= c to least_upper_bound(b,c)
% 0.60/0.99 goal joined
% 0.60/0.99 % SZS status Unsatisfiable
% 0.60/0.99 #START OF PROOF
% 0.60/0.99 % SZS output start CNFRefutation
% 0.60/0.99 cnf('0.12.0.0',axiom,
% 0.60/0.99 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.60/0.99 file('/tmp/WALDMEISTER_5408_n017')).
% 0.60/0.99 cnf('0.12.1.0',plain,
% 0.60/0.99 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.60/0.99 inference(weigh,[status(thm)],['0.12.0.0']),
% 0.60/0.99 [weight('<11,0,0,[0,0,0,12]>')]).
% 0.60/0.99 cnf('0.12.2.0',plain,
% 0.60/0.99 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.60/0.99 inference(activate,[status(thm)],['0.12.1.0']),
% 0.60/0.99 [equation_1]).
% 0.60/0.99 cnf('0.13.0.0',axiom,
% 0.60/0.99 ( least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3) ),
% 0.60/0.99 file('/tmp/WALDMEISTER_5408_n017')).
% 0.60/0.99 cnf('0.13.1.0',plain,
% 0.60/0.99 ( least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3) ),
% 0.60/0.99 inference(weigh,[status(thm)],['0.13.0.0']),
% 0.60/0.99 [weight('<12,0,0,[0,0,0,13]>')]).
% 0.60/0.99 cnf('0.13.2.0',plain,
% 0.60/0.99 ( least_upper_bound(least_upper_bound(X1,X2),X3) = least_upper_bound(X1,least_upper_bound(X2,X3)) ),
% 0.60/0.99 inference(orient,[status(thm)],['0.13.1.0',theory(equality)]),
% 0.60/0.99 [x,rule_12]).
% 0.60/0.99 cnf('0.14.0.0',axiom,
% 0.60/0.99 ( least_upper_bound(a,c) = c ),
% 0.60/0.99 file('/tmp/WALDMEISTER_5408_n017')).
% 0.60/0.99 cnf('0.14.1.0',plain,
% 0.60/0.99 ( least_upper_bound(a,c) = c ),
% 0.60/0.99 inference(weigh,[status(thm)],['0.14.0.0']),
% 0.60/0.99 [weight('<13,0,0,[0,0,0,14]>')]).
% 0.60/0.99 cnf('0.14.2.0',plain,
% 0.60/0.99 ( least_upper_bound(a,c) = c ),
% 0.60/0.99 inference(orient,[status(thm)],['0.14.1.0',theory(equality)]),
% 0.60/0.99 [u,rule_13]).
% 0.60/0.99 cnf('0.15.0.0',axiom,
% 0.60/0.99 ( least_upper_bound(b,c) = c ),
% 0.60/0.99 file('/tmp/WALDMEISTER_5408_n017')).
% 0.60/0.99 cnf('0.15.1.0',plain,
% 0.60/0.99 ( least_upper_bound(b,c) = c ),
% 0.60/0.99 inference(weigh,[status(thm)],['0.15.0.0']),
% 0.60/0.99 [weight('<14,0,0,[0,0,0,15]>')]).
% 0.60/0.99 cnf('0.15.2.0',plain,
% 0.60/0.99 ( least_upper_bound(b,c) = c ),
% 0.60/0.99 inference(orient,[status(thm)],['0.15.1.0',theory(equality)]),
% 0.60/0.99 [u,rule_14]).
% 0.60/0.99 cnf('1.0.0.0',conjecture,
% 0.60/0.99 ( least_upper_bound(least_upper_bound(a,b),c) = c ),
% 0.60/0.99 file('/tmp/WALDMEISTER_5408_n017',conjecture_1)).
% 0.60/0.99 cnf('1.0.0.1',plain,
% 0.60/0.99 ( least_upper_bound(least_upper_bound(b,a),c) = c ),
% 0.60/0.99 inference(reduction,[status(thm)],['1.0.0.0','0.12.2.0',theory(equality)]),
% 0.60/0.99 [pos('L.1','L')]).
% 0.60/0.99 cnf('1.0.0.2',plain,
% 0.60/0.99 ( least_upper_bound(b,least_upper_bound(a,c)) = c ),
% 0.60/0.99 inference(reduction,[status(thm)],['1.0.0.1','0.13.2.0',theory(equality)]),
% 0.60/0.99 [pos('L','L')]).
% 0.60/0.99 cnf('1.0.0.3',plain,
% 0.60/0.99 ( least_upper_bound(b,c) = c ),
% 0.60/0.99 inference(reduction,[status(thm)],['1.0.0.2','0.14.2.0',theory(equality)]),
% 0.60/0.99 [pos('L.2','L')]).
% 0.60/0.99 cnf('1.0.0.4',plain,
% 0.60/0.99 ( least_upper_bound(b,c) = least_upper_bound(b,c) ),
% 0.60/0.99 inference(reduction,[status(thm)],['1.0.0.3','0.15.2.0',theory(equality)]),
% 0.60/0.99 [pos('R','R')]).
% 0.60/0.99 cnf('1.0.0.5',plain,
% 0.60/0.99 ( $true ),
% 0.60/0.99 inference(trivial,[status(thm)],['1.0.0.4',theory(equality)]),
% 0.60/0.99 [conjecture_1]).
% 0.60/0.99
% 0.60/0.99 Proved Goals:
% 0.60/0.99 No. 1: least_upper_bound(least_upper_bound(a,b),c) ?= c joined, current: least_upper_bound(b,c) = least_upper_bound(b,c)
% 0.60/0.99 1 goal was specified, which was proved.
% 0.60/0.99 % SZS output end CNFRefutation
% 0.60/0.99 #END OF PROOF
% 0.60/0.99
% 0.60/0.99 Problem WALDMEISTER_5408_n017
% 0.60/0.99 CPs.gen 48
% 0.60/0.99 CPs.reexp 0
% 0.60/0.99 Select 15
% 0.60/0.99 R 14
% 0.60/0.99 E 1
% 0.60/0.99 vsize 6.4M
% 0.60/0.99 rss 3.7M
% 0.60/0.99 process.time 0.003s
% 0.60/0.99 wallclock.time 0.004s
% 0.60/0.99 status S
% 0.60/0.99
% 0.60/0.99
% 0.60/0.99 Waldmeister states: Goal proved.
% 0.60/0.99 % SZS status Unsatisfiable
% 0.60/0.99
% 0.60/0.99 Problem WALDMEISTER_5408_n017
% 0.60/0.99 CPs.gen 0
% 0.60/0.99 CPs.reexp 0
% 0.60/0.99 Select 0
% 0.60/0.99 R 0
% 0.60/0.99 E 0
% 0.60/0.99 vsize 6.0M
% 0.60/0.99 rss 3.3M
% 0.60/0.99 process.time 0.001s
% 0.60/0.99 wallclock.time 0.003s
% 0.60/0.99 status S
%------------------------------------------------------------------------------