TSTP Solution File: HEN009-4 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : HEN009-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n014.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 : Thu Aug 31 01:54:09 EDT 2023
% Result : Unsatisfiable 0.19s 0.67s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN009-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n014.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 : 300
% 0.13/0.34 % DateTime : Thu Aug 24 13:25:03 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof:theBenchmark
% 0.19/0.66 %-------------------------------------------
% 0.19/0.66 % File :CSE---1.6
% 0.19/0.66 % Problem :theBenchmark
% 0.19/0.66 % Transform :cnf
% 0.19/0.66 % Format :tptp:raw
% 0.19/0.66 % Command :java -jar mcs_scs.jar %d %s
% 0.19/0.66
% 0.19/0.67 % Result :Theorem 0.070000s
% 0.19/0.67 % Output :CNFRefutation 0.070000s
% 0.19/0.67 %-------------------------------------------
% 0.19/0.67 %--------------------------------------------------------------------------
% 0.19/0.67 % File : HEN009-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.19/0.67 % Domain : Henkin Models
% 0.19/0.67 % Problem : Define X' as identity/X. Then X' = X'''
% 0.19/0.67 % Version : [MOW76] axioms : Augmented.
% 0.19/0.67 % English :
% 0.19/0.67
% 0.19/0.67 % Refs : [MOW76] McCharen et al. (1976), Problems and Experiments for a
% 0.19/0.67 % Source : [TPTP]
% 0.19/0.67 % Names :
% 0.19/0.67
% 0.19/0.67 % Status : Unsatisfiable
% 0.19/0.67 % Rating : 0.00 v7.4.0, 0.11 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.00 v6.0.0, 0.11 v5.5.0, 0.31 v5.4.0, 0.33 v5.3.0, 0.42 v5.2.0, 0.12 v5.1.0, 0.00 v3.3.0, 0.14 v3.2.0, 0.00 v2.0.0
% 0.19/0.67 % Syntax : Number of clauses : 16 ( 9 unt; 0 nHn; 7 RR)
% 0.19/0.67 % Number of literals : 25 ( 8 equ; 10 neg)
% 0.19/0.67 % Maximal clause size : 3 ( 1 avg)
% 0.19/0.67 % Maximal term depth : 4 ( 1 avg)
% 0.19/0.67 % Number of predicates : 2 ( 1 usr; 0 prp; 2-2 aty)
% 0.19/0.67 % Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% 0.19/0.67 % Number of variables : 28 ( 5 sgn)
% 0.19/0.67 % SPC : CNF_UNS_RFO_SEQ_HRN
% 0.19/0.67
% 0.19/0.67 % Comments :
% 0.19/0.67 % Bugfixes : v1.2.1 - Clauses id_divide_a_is_b, id_divide_b_is_c,
% 0.19/0.67 % id_divide_c_is_d, and prove_b_equals_d, removed.
% 0.19/0.67 %--------------------------------------------------------------------------
% 0.19/0.67 %----Include Henkin model axioms for equality formulation
% 0.19/0.67 include('Axioms/HEN002-0.ax').
% 0.19/0.67 %--------------------------------------------------------------------------
% 0.19/0.67 cnf(everything_divide_id_is_zero,axiom,
% 0.19/0.67 divide(X,identity) = zero ).
% 0.19/0.67
% 0.19/0.67 cnf(zero_divide_anything_is_zero,axiom,
% 0.19/0.67 divide(zero,X) = zero ).
% 0.19/0.67
% 0.19/0.67 cnf(x_divide_x_is_zero,axiom,
% 0.19/0.67 divide(X,X) = zero ).
% 0.19/0.67
% 0.19/0.67 cnf(x_divide_zero_is_x,axiom,
% 0.19/0.67 divide(a,zero) = a ).
% 0.19/0.67
% 0.19/0.67 cnf(transitivity_of_less_equal,axiom,
% 0.19/0.67 ( ~ less_equal(X,Y)
% 0.19/0.67 | ~ less_equal(Y,Z)
% 0.19/0.67 | less_equal(X,Z) ) ).
% 0.19/0.67
% 0.19/0.67 cnf(property_of_divide1,axiom,
% 0.19/0.67 ( ~ less_equal(divide(X,Y),Z)
% 0.19/0.67 | less_equal(divide(X,Z),Y) ) ).
% 0.19/0.67
% 0.19/0.67 cnf(property_of_divide2,axiom,
% 0.19/0.67 ( ~ less_equal(X,Y)
% 0.19/0.67 | less_equal(divide(Z,Y),divide(Z,X)) ) ).
% 0.19/0.67
% 0.19/0.67 cnf(property_of_divide3,axiom,
% 0.19/0.67 ( ~ less_equal(X,Y)
% 0.19/0.67 | less_equal(divide(X,Z),divide(Y,Z)) ) ).
% 0.19/0.67
% 0.19/0.67 cnf(prove_this,negated_conjecture,
% 0.19/0.67 divide(identity,a) != divide(identity,divide(identity,divide(identity,a))) ).
% 0.19/0.67
% 0.19/0.67 %----This is an alternate way of writing the theorem
% 0.19/0.67 %input_clause(id_divide_a_is_b,hypothesis,
% 0.19/0.67 % [++equal(divide(identity,a),b)]).
% 0.19/0.67 %
% 0.19/0.67 %input_clause(id_divide_b_is_c,hypothesis,
% 0.19/0.67 % [++equal(divide(identity,b),c)]).
% 0.19/0.67 %
% 0.19/0.67 %input_clause(id_divide_c_is_d,hypothesis,
% 0.19/0.67 % [++equal(divide(identity,c),d)]).
% 0.19/0.67 %
% 0.19/0.67 %input_clause(prove_b_equals_d,negated_conjecture,
% 0.19/0.67 % [--equal(b,d)]).
% 0.19/0.67 %--------------------------------------------------------------------------
% 0.19/0.67 %-------------------------------------------
% 0.19/0.67 % Proof found
% 0.19/0.67 % SZS status Theorem for theBenchmark
% 0.19/0.67 % SZS output start Proof
% 0.19/0.67 %ClaNum:23(EqnAxiom:7)
% 0.19/0.67 %VarNum:54(SingletonVarNum:28)
% 0.19/0.67 %MaxLitNum:3
% 0.19/0.67 %MaxfuncDepth:3
% 0.19/0.67 %SharedTerms:9
% 0.19/0.67 %goalClause: 16
% 0.19/0.67 %singleGoalClaCount:1
% 0.19/0.67 [8]E(f3(a1,a2),a1)
% 0.19/0.67 [16]~E(f3(a4,f3(a4,f3(a4,a1))),f3(a4,a1))
% 0.19/0.67 [11]P1(x111,a4)
% 0.19/0.67 [12]P1(a2,x121)
% 0.19/0.67 [9]E(f3(x91,a4),a2)
% 0.19/0.67 [10]E(f3(a2,x101),a2)
% 0.19/0.67 [13]E(f3(x131,x131),a2)
% 0.19/0.67 [14]P1(f3(x141,x142),x141)
% 0.19/0.67 [15]P1(f3(f3(x151,x152),f3(x153,x152)),f3(f3(x151,x153),x152))
% 0.19/0.67 [17]~P1(x171,x172)+E(f3(x171,x172),a2)
% 0.19/0.67 [18]P1(x181,x182)+~E(f3(x181,x182),a2)
% 0.19/0.67 [21]~P1(x213,x212)+P1(f3(x211,x212),f3(x211,x213))
% 0.19/0.67 [22]~P1(x221,x223)+P1(f3(x221,x222),f3(x223,x222))
% 0.19/0.67 [23]~P1(f3(x231,x233),x232)+P1(f3(x231,x232),x233)
% 0.19/0.67 [19]~P1(x192,x191)+~P1(x191,x192)+E(x191,x192)
% 0.19/0.67 [20]~P1(x201,x203)+P1(x201,x202)+~P1(x203,x202)
% 0.19/0.67 %EqnAxiom
% 0.19/0.67 [1]E(x11,x11)
% 0.19/0.67 [2]E(x22,x21)+~E(x21,x22)
% 0.19/0.67 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.19/0.67 [4]~E(x41,x42)+E(f3(x41,x43),f3(x42,x43))
% 0.19/0.67 [5]~E(x51,x52)+E(f3(x53,x51),f3(x53,x52))
% 0.19/0.67 [6]P1(x62,x63)+~E(x61,x62)+~P1(x61,x63)
% 0.19/0.67 [7]P1(x73,x72)+~E(x71,x72)+~P1(x73,x71)
% 0.19/0.67
% 0.19/0.67 %-------------------------------------------
% 0.19/0.68 cnf(26,plain,
% 0.19/0.68 (P1(x261,x261)),
% 0.19/0.68 inference(scs_inference,[],[16,8,13,2,5,18])).
% 0.19/0.68 cnf(29,plain,
% 0.19/0.68 (P1(f3(x291,x292),x291)),
% 0.19/0.68 inference(rename_variables,[],[14])).
% 0.19/0.68 cnf(42,plain,
% 0.19/0.68 (~P1(f3(a4,f3(a4,f3(a4,a1))),f3(a4,a1))+~P1(f3(a4,a1),f3(a4,f3(a4,f3(a4,a1))))),
% 0.19/0.68 inference(scs_inference,[],[16,11,8,14,29,13,2,5,18,7,6,3,4,22,21,17,23,19])).
% 0.19/0.68 cnf(187,plain,
% 0.19/0.68 (P1(f3(x1871,f3(x1871,x1872)),x1872)),
% 0.19/0.68 inference(scs_inference,[],[26,23])).
% 0.19/0.68 cnf(215,plain,
% 0.19/0.68 (~P1(f3(a4,a1),f3(a4,f3(a4,f3(a4,a1))))),
% 0.19/0.68 inference(scs_inference,[],[187,42])).
% 0.19/0.68 cnf(237,plain,
% 0.19/0.68 ($false),
% 0.19/0.68 inference(scs_inference,[],[14,215,187,23,21]),
% 0.19/0.68 ['proof']).
% 0.19/0.68 % SZS output end Proof
% 0.19/0.68 % Total time :0.070000s
%------------------------------------------------------------------------------