TSTP Solution File: ROB030-1 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : ROB030-1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n032.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 : Mon Jul 18 20:57:18 EDT 2022
% Result : Unsatisfiable 0.41s 0.81s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : ROB030-1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.10 % Command : woody %s
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Thu Jun 9 13:17:07 EDT 2022
% 0.13/0.29 % CPUTime :
% 0.41/0.81 ********************************************************************************
% 0.41/0.81 * W A L D M E I S T E R \| \ / \|/ *
% 0.41/0.81 * |/ | \/ | *
% 0.41/0.81 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.41/0.81 * A. Jaeger and B. Loechner | | *
% 0.41/0.81 * <waldmeister@informatik.uni-kl.de> | *
% 0.41/0.81 ********************************************************************************
% 0.41/0.81
% 0.41/0.81
% 0.41/0.81 Goals:
% 0.41/0.81 ------
% 0.41/0.81
% 0.41/0.81 ( 1) true ?= false
% 0.41/0.81 using narrowing to prove negate(x1) ?= negate(add(x2,x1))
% 0.41/0.81
% 0.41/0.81 Detected structure: RobbinsAlgebra
% 0.41/0.81 ********************************************************************************
% 0.41/0.81 ****************************** COMPLETION - PROOF ******************************
% 0.41/0.81 ********************************************************************************
% 0.41/0.81
% 0.41/0.81 joined goal: 1 negate(x1) ?= negate(add(x2,x1)) to false
% 0.41/0.81 goal joined
% 0.41/0.81 % SZS status Unsatisfiable
% 0.41/0.81 #START OF PROOF
% 0.41/0.81 % SZS output start CNFRefutation
% 0.41/0.81 cnf('0.4.0.0',axiom,
% 0.41/0.81 ( add(c,d) = d ),
% 0.41/0.81 file('/tmp/WALDMEISTER_17668_n032')).
% 0.41/0.81 cnf('0.4.1.0',plain,
% 0.41/0.81 ( add(c,d) = d ),
% 0.41/0.81 inference(weigh,[status(thm)],['0.4.0.0']),
% 0.41/0.81 [weight('<3,0,0,[0,0,0,4]>')]).
% 0.41/0.81 cnf('0.4.2.0',plain,
% 0.41/0.81 ( add(c,d) = d ),
% 0.41/0.81 inference(orient,[status(thm)],['0.4.1.0',theory(equality)]),
% 0.41/0.81 [u,rule_3]).
% 0.41/0.81 cnf('0.5.0.0',axiom,
% 0.41/0.81 ( eq(X1,X1) = true ),
% 0.41/0.81 file('/tmp/WALDMEISTER_17668_n032')).
% 0.41/0.81 cnf('0.5.1.0',plain,
% 0.41/0.81 ( eq(X1,X1) = true ),
% 0.41/0.81 inference(weigh,[status(thm)],['0.5.0.0']),
% 0.41/0.81 [weight('<4,0,0,[0,0,0,5]>')]).
% 0.41/0.81 cnf('0.5.2.0',plain,
% 0.41/0.81 ( eq(X1,X1) = true ),
% 0.41/0.81 inference(orient,[status(thm)],['0.5.1.0',theory(equality)]),
% 0.41/0.81 [u,rule_4]).
% 0.41/0.81 cnf('0.6.0.0',axiom,
% 0.41/0.81 ( eq(negate(X1),negate(add(X2,X1))) = false ),
% 0.41/0.81 file('/tmp/WALDMEISTER_17668_n032')).
% 0.41/0.81 cnf('0.6.1.0',plain,
% 0.41/0.81 ( eq(negate(X1),negate(add(X2,X1))) = false ),
% 0.41/0.81 inference(weigh,[status(thm)],['0.6.0.0']),
% 0.41/0.81 [weight('<5,0,0,[0,0,0,6]>')]).
% 0.41/0.81 cnf('0.6.2.0',plain,
% 0.41/0.81 ( eq(negate(X1),negate(add(X2,X1))) = false ),
% 0.41/0.81 inference(orient,[status(thm)],['0.6.1.0',theory(equality)]),
% 0.41/0.81 [u,rule_5]).
% 0.41/0.81 cnf('0.7.0.0',plain,
% 0.41/0.81 ( false = eq(negate(d),negate(d)) ),
% 0.41/0.81 inference(cp,[status(thm)],['0.6.2.0','0.4.2.0',theory(equality)]),
% 0.41/0.81 [pos('L.2.1','L')]).
% 0.41/0.81 cnf('0.7.0.1',plain,
% 0.41/0.81 ( false = true ),
% 0.41/0.81 inference(reduction,[status(thm)],['0.7.0.0','0.5.2.0',theory(equality)]),
% 0.41/0.81 [pos('R','L')]).
% 0.41/0.81 cnf('0.7.1.0',plain,
% 0.41/0.81 ( false = true ),
% 0.41/0.81 inference(weigh,[status(thm)],['0.7.0.1']),
% 0.41/0.81 [weight('<5,6,4,[1,0,0,4]>')]).
% 0.41/0.81 cnf('0.7.2.0',plain,
% 0.41/0.81 ( true = false ),
% 0.41/0.81 inference(orient,[status(thm)],['0.7.1.0',theory(equality)]),
% 0.41/0.81 [x,rule_6]).
% 0.41/0.81 cnf('1.0.0.0',conjecture,
% 0.41/0.81 ( true = false ),
% 0.41/0.81 file('/tmp/WALDMEISTER_17668_n032',conjecture_1)).
% 0.41/0.81 cnf('1.0.0.1',plain,
% 0.41/0.81 ( false = false ),
% 0.41/0.81 inference(reduction,[status(thm)],['1.0.0.0','0.7.2.0',theory(equality)]),
% 0.41/0.81 [pos('L','L')]).
% 0.41/0.81 cnf('1.0.0.2',plain,
% 0.41/0.81 ( $true ),
% 0.41/0.81 inference(trivial,[status(thm)],['1.0.0.1',theory(equality)]),
% 0.41/0.81 [conjecture_1]).
% 0.41/0.81
% 0.41/0.81 Proved Goals:
% 0.41/0.81 No. 1: true ?= false, current false ?= false
% 0.41/0.81 using narrowing to prove negate(x1) ?= negate(add(x2,x1))
% 0.41/0.81
% 0.41/0.81 1 goal was specified, which was proved.
% 0.41/0.81 % SZS output end CNFRefutation
% 0.41/0.81 #END OF PROOF
% 0.41/0.81
% 0.41/0.81 Problem WALDMEISTER_17668_n032
% 0.41/0.81 CPs.gen 18
% 0.41/0.81 CPs.reexp 0
% 0.41/0.81 Select 7
% 0.41/0.81 R 6
% 0.41/0.81 E 1
% 0.41/0.81 vsize 6.4M
% 0.41/0.81 rss 3.5M
% 0.41/0.81 process.time 0.002s
% 0.41/0.81 wallclock.time 0.002s
% 0.41/0.81 status S
% 0.41/0.81
% 0.41/0.81
% 0.41/0.81 Waldmeister states: Goal proved.
% 0.41/0.81 % SZS status Unsatisfiable
%------------------------------------------------------------------------------