TSTP Solution File: LCL439-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL439-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n009.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 06:49:19 EDT 2023
% Result : Unsatisfiable 0.59s 0.68s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL439-2 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n009.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 24 18:15:36 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.61 start to proof:theBenchmark
% 0.59/0.67 %-------------------------------------------
% 0.59/0.67 % File :CSE---1.6
% 0.59/0.67 % Problem :theBenchmark
% 0.59/0.67 % Transform :cnf
% 0.59/0.67 % Format :tptp:raw
% 0.59/0.67 % Command :java -jar mcs_scs.jar %d %s
% 0.59/0.67
% 0.59/0.67 % Result :Theorem 0.010000s
% 0.59/0.67 % Output :CNFRefutation 0.010000s
% 0.59/0.67 %-------------------------------------------
% 0.59/0.68 %------------------------------------------------------------------------------
% 0.59/0.68 % File : LCL439-2 : TPTP v8.1.2. Released v3.2.0.
% 0.59/0.68 % Domain : Logic Calculi (Propositional)
% 0.59/0.68 % Problem : Problem about propositional logic
% 0.59/0.68 % Version : [Pau06] axioms : Reduced > Especial.
% 0.59/0.68 % English :
% 0.59/0.68
% 0.59/0.68 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.59/0.68 % Source : [Pau06]
% 0.59/0.68 % Names :
% 0.59/0.68
% 0.59/0.68 % Status : Unsatisfiable
% 0.59/0.68 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.59/0.68 % Syntax : Number of clauses : 7 ( 3 unt; 0 nHn; 4 RR)
% 0.59/0.68 % Number of literals : 12 ( 0 equ; 6 neg)
% 0.59/0.68 % Maximal clause size : 3 ( 1 avg)
% 0.59/0.68 % Maximal term depth : 4 ( 1 avg)
% 0.59/0.68 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% 0.59/0.68 % Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% 0.59/0.68 % Number of variables : 18 ( 3 sgn)
% 0.59/0.68 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.59/0.68
% 0.59/0.68 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.59/0.68 % of which only a small selection are required for the refutation.
% 0.59/0.68 % The mission is to find those few axioms, after which a refutation
% 0.59/0.68 % can be quite easily found. This version has only the necessary
% 0.59/0.68 % axioms.
% 0.59/0.68 %------------------------------------------------------------------------------
% 0.59/0.68 cnf(cls_PropLog_Odeduction_0,axiom,
% 0.59/0.68 ( ~ c_in(V_q,c_PropLog_Othms(c_insert(V_p,V_H,tc_PropLog_Opl(T_a)),T_a),tc_PropLog_Opl(T_a))
% 0.59/0.68 | c_in(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ).
% 0.59/0.68
% 0.59/0.68 cnf(cls_PropLog_Othms_OH_0,axiom,
% 0.59/0.68 ( ~ c_in(V_p,V_H,tc_PropLog_Opl(T_a))
% 0.59/0.68 | c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ).
% 0.59/0.68
% 0.59/0.68 cnf(cls_PropLog_Othms__notE_0,axiom,
% 0.59/0.68 ( ~ c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))
% 0.59/0.68 | ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p,c_PropLog_Opl_Ofalse,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))
% 0.59/0.68 | c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ).
% 0.59/0.68
% 0.59/0.68 cnf(cls_PropLog_Oweaken__left__insert_0,axiom,
% 0.59/0.68 ( ~ c_in(V_p,c_PropLog_Othms(V_G,T_a),tc_PropLog_Opl(T_a))
% 0.59/0.68 | c_in(V_p,c_PropLog_Othms(c_insert(V_a,V_G,tc_PropLog_Opl(T_a)),T_a),tc_PropLog_Opl(T_a)) ) ).
% 0.59/0.68
% 0.59/0.68 cnf(cls_Set_OinsertCI_1,axiom,
% 0.59/0.68 c_in(V_x,c_insert(V_x,V_B,T_a),T_a) ).
% 0.59/0.68
% 0.59/0.68 cnf(cls_conjecture_0,negated_conjecture,
% 0.59/0.68 c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ).
% 0.59/0.68
% 0.59/0.68 cnf(cls_conjecture_1,negated_conjecture,
% 0.59/0.68 ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ).
% 0.59/0.68
% 0.59/0.68 %------------------------------------------------------------------------------
% 0.59/0.68 %-------------------------------------------
% 0.59/0.68 % Proof found
% 0.59/0.68 % SZS status Theorem for theBenchmark
% 0.59/0.68 % SZS output start Proof
% 0.59/0.68 %ClaNum:7(EqnAxiom:0)
% 0.59/0.68 %VarNum:47(SingletonVarNum:18)
% 0.59/0.68 %MaxLitNum:3
% 0.59/0.68 %MaxfuncDepth:3
% 0.59/0.68 %SharedTerms:11
% 0.59/0.68 %goalClause: 2 3
% 0.59/0.68 %singleGoalClaCount:2
% 0.59/0.68 [2]P1(f3(a5,a2,a6),f4(a7,a6),f8(a6))
% 0.59/0.68 [3]~P1(f3(a5,a9,a6),f4(a7,a6),f8(a6))
% 0.59/0.68 [1]P1(x11,f1(x11,x12,x13),x13)
% 0.59/0.68 [4]~P1(x41,x42,f8(x43))+P1(x41,f4(x42,x43),f8(x43))
% 0.59/0.68 [5]~P1(x51,f4(x53,x54),f8(x54))+P1(x51,f4(f1(x52,x53,f8(x54)),x54),f8(x54))
% 0.59/0.68 [7]P1(f3(x71,x72,x73),f4(x74,x73),f8(x73))+~P1(x72,f4(f1(x71,x74,f8(x73)),x73),f8(x73))
% 0.59/0.68 [6]P1(x61,f4(x62,x63),f8(x63))+~P1(x64,f4(x62,x63),f8(x63))+~P1(f3(x64,a2,x63),f4(x62,x63),f8(x63))
% 0.59/0.68 %EqnAxiom
% 0.59/0.68
% 0.59/0.68 %-------------------------------------------
% 0.59/0.68 cnf(10,plain,
% 0.59/0.68 (P1(f3(a5,a2,a6),f4(f1(x101,a7,f8(a6)),a6),f8(a6))),
% 0.59/0.68 inference(scs_inference,[],[2,3,4,6,5])).
% 0.59/0.68 cnf(12,plain,
% 0.59/0.68 (~P1(a9,f4(f1(a5,a7,f8(a6)),a6),f8(a6))),
% 0.59/0.68 inference(scs_inference,[],[2,3,4,6,5,7])).
% 0.59/0.68 cnf(14,plain,
% 0.59/0.68 (~P1(f3(f3(a5,a2,a6),a2,a6),f4(a7,a6),f8(a6))),
% 0.59/0.68 inference(scs_inference,[],[2,3,6])).
% 0.59/0.68 cnf(20,plain,
% 0.59/0.68 (P1(f3(x201,f3(a5,a2,a6),a6),f4(a7,a6),f8(a6))),
% 0.59/0.68 inference(scs_inference,[],[2,3,12,10,6,4,5,7])).
% 0.59/0.68 cnf(28,plain,
% 0.59/0.68 (~P1(a2,f4(f1(f3(a5,a2,a6),a7,f8(a6)),a6),f8(a6))),
% 0.59/0.68 inference(scs_inference,[],[3,20,14,4,6,5,7])).
% 0.59/0.68 cnf(33,plain,
% 0.59/0.68 (P1(x331,f4(f1(x331,x332,f8(x333)),x333),f8(x333))),
% 0.59/0.68 inference(scs_inference,[],[1,28,10,6,4])).
% 0.59/0.68 cnf(57,plain,
% 0.59/0.68 ($false),
% 0.59/0.68 inference(scs_inference,[],[12,10,33,6]),
% 0.59/0.68 ['proof']).
% 0.59/0.68 % SZS output end Proof
% 0.59/0.68 % Total time :0.010000s
%------------------------------------------------------------------------------