TSTP Solution File: LCL433-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL433-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 : n022.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:16 EDT 2023
% Result : Unsatisfiable 0.21s 0.63s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL433-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.18/0.34 % Computer : n022.cluster.edu
% 0.18/0.34 % Model : x86_64 x86_64
% 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34 % Memory : 8042.1875MB
% 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34 % CPULimit : 300
% 0.18/0.34 % WCLimit : 300
% 0.18/0.34 % DateTime : Thu Aug 24 20:51:55 EDT 2023
% 0.18/0.34 % CPUTime :
% 0.21/0.57 start to proof:theBenchmark
% 0.21/0.62 %-------------------------------------------
% 0.21/0.62 % File :CSE---1.6
% 0.21/0.62 % Problem :theBenchmark
% 0.21/0.62 % Transform :cnf
% 0.21/0.62 % Format :tptp:raw
% 0.21/0.62 % Command :java -jar mcs_scs.jar %d %s
% 0.21/0.62
% 0.21/0.62 % Result :Theorem 0.000000s
% 0.21/0.62 % Output :CNFRefutation 0.000000s
% 0.21/0.62 %-------------------------------------------
% 0.21/0.62 %------------------------------------------------------------------------------
% 0.21/0.62 % File : LCL433-2 : TPTP v8.1.2. Released v3.2.0.
% 0.21/0.62 % Domain : Logic Calculi (Propositional)
% 0.21/0.62 % Problem : Problem about propositional logic
% 0.21/0.62 % Version : [Pau06] axioms : Reduced > Especial.
% 0.21/0.62 % English :
% 0.21/0.62
% 0.21/0.62 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.21/0.62 % Source : [Pau06]
% 0.21/0.62 % Names :
% 0.21/0.62
% 0.21/0.62 % Status : Unsatisfiable
% 0.21/0.62 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.21/0.62 % Syntax : Number of clauses : 8 ( 3 unt; 0 nHn; 6 RR)
% 0.21/0.62 % Number of literals : 14 ( 0 equ; 7 neg)
% 0.21/0.62 % Maximal clause size : 3 ( 1 avg)
% 0.21/0.62 % Maximal term depth : 4 ( 1 avg)
% 0.21/0.62 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty)
% 0.21/0.62 % Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% 0.21/0.62 % Number of variables : 19 ( 2 sgn)
% 0.21/0.62 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.21/0.62
% 0.21/0.62 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.21/0.62 % of which only a small selection are required for the refutation.
% 0.21/0.62 % The mission is to find those few axioms, after which a refutation
% 0.21/0.62 % can be quite easily found. This version has only the necessary
% 0.21/0.62 % axioms.
% 0.21/0.62 %------------------------------------------------------------------------------
% 0.21/0.62 cnf(cls_conjecture_2,negated_conjecture,
% 0.21/0.62 c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a) ).
% 0.21/0.62
% 0.21/0.62 cnf(cls_conjecture_3,negated_conjecture,
% 0.21/0.62 ~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ).
% 0.21/0.62
% 0.21/0.62 cnf(cls_conjecture_4,negated_conjecture,
% 0.21/0.62 ( c_in(V_U,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))
% 0.21/0.62 | ~ c_PropLog_Osat(v_F,V_U,t_a) ) ).
% 0.21/0.62
% 0.21/0.62 cnf(cls_PropLog_Osat__imp_0,axiom,
% 0.21/0.62 ( ~ c_PropLog_Osat(c_insert(V_p,V_H,tc_PropLog_Opl(T_a)),V_q,T_a)
% 0.21/0.62 | c_PropLog_Osat(V_H,c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),T_a) ) ).
% 0.21/0.62
% 0.21/0.62 cnf(cls_PropLog_Othms_OH_0,axiom,
% 0.21/0.62 ( ~ c_in(V_p,V_H,tc_PropLog_Opl(T_a))
% 0.21/0.62 | c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ).
% 0.21/0.62
% 0.21/0.62 cnf(cls_PropLog_Othms_OMP_0,axiom,
% 0.21/0.63 ( ~ c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))
% 0.21/0.63 | ~ 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.21/0.63 | c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ).
% 0.21/0.63
% 0.21/0.63 cnf(cls_PropLog_Oweaken__left__insert_0,axiom,
% 0.21/0.63 ( ~ c_in(V_p,c_PropLog_Othms(V_G,T_a),tc_PropLog_Opl(T_a))
% 0.21/0.63 | 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.21/0.63
% 0.21/0.63 cnf(cls_Set_OinsertCI_1,axiom,
% 0.21/0.63 c_in(V_x,c_insert(V_x,V_B,T_a),T_a) ).
% 0.21/0.63
% 0.21/0.63 %------------------------------------------------------------------------------
% 0.21/0.63 %-------------------------------------------
% 0.21/0.63 % Proof found
% 0.21/0.63 % SZS status Theorem for theBenchmark
% 0.21/0.63 % SZS output start Proof
% 0.21/0.63 %ClaNum:8(EqnAxiom:0)
% 0.21/0.63 %VarNum:48(SingletonVarNum:19)
% 0.21/0.63 %MaxLitNum:3
% 0.21/0.63 %MaxfuncDepth:3
% 0.21/0.63 %SharedTerms:10
% 0.21/0.63 %goalClause: 1 3 4
% 0.21/0.63 %singleGoalClaCount:2
% 0.21/0.63 [1]P1(f4(a1,a2,f7(a3)),a8,a3)
% 0.21/0.63 [3]~P2(a8,f5(f4(a1,a2,f7(a3)),a3),f7(a3))
% 0.21/0.63 [2]P2(x21,f4(x21,x22,x23),x23)
% 0.21/0.63 [4]~P1(a2,x41,a3)+P2(x41,f5(a2,a3),f7(a3))
% 0.21/0.63 [5]~P2(x51,x52,f7(x53))+P2(x51,f5(x52,x53),f7(x53))
% 0.21/0.63 [6]P1(x61,f6(x62,x63,x64),x64)+~P1(f4(x62,x61,f7(x64)),x63,x64)
% 0.21/0.63 [7]~P2(x71,f5(x73,x74),f7(x74))+P2(x71,f5(f4(x72,x73,f7(x74)),x74),f7(x74))
% 0.21/0.63 [8]~P2(f6(x84,x81,x83),f5(x82,x83),f7(x83))+P2(x81,f5(x82,x83),f7(x83))+~P2(x84,f5(x82,x83),f7(x83))
% 0.21/0.63 %EqnAxiom
% 0.21/0.63
% 0.21/0.63 %-------------------------------------------
% 0.21/0.63 cnf(11,plain,
% 0.21/0.63 (~P2(a8,f5(a2,a3),f7(a3))),
% 0.21/0.63 inference(scs_inference,[],[1,3,5,6,7])).
% 0.21/0.63 cnf(13,plain,
% 0.21/0.63 (P2(f6(a1,a8,a3),f5(a2,a3),f7(a3))),
% 0.21/0.63 inference(scs_inference,[],[1,3,5,6,7,4])).
% 0.21/0.63 cnf(15,plain,
% 0.21/0.63 (~P2(f6(x151,a8,a3),f5(f4(a1,a2,f7(a3)),a3),f7(a3))+~P2(x151,f5(f4(a1,a2,f7(a3)),a3),f7(a3))),
% 0.21/0.63 inference(scs_inference,[],[1,3,5,6,7,4,8])).
% 0.21/0.63 cnf(26,plain,
% 0.21/0.63 ($false),
% 0.21/0.63 inference(scs_inference,[],[2,13,11,4,8,5,7,15]),
% 0.21/0.63 ['proof']).
% 0.21/0.63 % SZS output end Proof
% 0.21/0.63 % Total time :0.000000s
%------------------------------------------------------------------------------