TSTP Solution File: LCL436-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL436-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n023.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:18 EDT 2023
% Result : Unsatisfiable 0.44s 0.61s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL436-2 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Aug 25 06:23:27 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.44/0.57 start to proof:theBenchmark
% 0.44/0.61 %-------------------------------------------
% 0.44/0.61 % File :CSE---1.6
% 0.44/0.61 % Problem :theBenchmark
% 0.44/0.61 % Transform :cnf
% 0.44/0.61 % Format :tptp:raw
% 0.44/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.44/0.61
% 0.44/0.61 % Result :Theorem 0.000000s
% 0.44/0.61 % Output :CNFRefutation 0.000000s
% 0.44/0.61 %-------------------------------------------
% 0.44/0.61 %------------------------------------------------------------------------------
% 0.44/0.61 % File : LCL436-2 : TPTP v8.1.2. Released v3.2.0.
% 0.44/0.61 % Domain : Logic Calculi (Propositional)
% 0.44/0.61 % Problem : Problem about propositional logic
% 0.44/0.61 % Version : [Pau06] axioms : Reduced > Especial.
% 0.44/0.61 % English :
% 0.44/0.61
% 0.44/0.61 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.44/0.61 % Source : [Pau06]
% 0.44/0.61 % Names :
% 0.44/0.61
% 0.44/0.61 % Status : Unsatisfiable
% 0.44/0.61 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.44/0.61 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 1 RR)
% 0.44/0.61 % Number of literals : 4 ( 0 equ; 2 neg)
% 0.44/0.61 % Maximal clause size : 2 ( 1 avg)
% 0.44/0.61 % Maximal term depth : 5 ( 2 avg)
% 0.44/0.61 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% 0.44/0.61 % Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% 0.44/0.61 % Number of variables : 9 ( 2 sgn)
% 0.44/0.61 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.44/0.61
% 0.44/0.61 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.44/0.61 % of which only a small selection are required for the refutation.
% 0.44/0.61 % The mission is to find those few axioms, after which a refutation
% 0.44/0.61 % can be quite easily found. This version has only the necessary
% 0.44/0.61 % axioms.
% 0.44/0.61 %------------------------------------------------------------------------------
% 0.44/0.61 cnf(cls_conjecture_0,negated_conjecture,
% 0.44/0.61 ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pa,c_PropLog_Opl_Oop_A_N_62(v_q,v_r,t_a),t_a),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),c_PropLog_Opl_Oop_A_N_62(v_pa,v_r,t_a),t_a),t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ).
% 0.44/0.61
% 0.44/0.61 cnf(cls_PropLog_Othms_OS_0,axiom,
% 0.44/0.61 c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p,c_PropLog_Opl_Oop_A_N_62(V_q,V_r,T_a),T_a),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Opl_Oop_A_N_62(V_p,V_r,T_a),T_a),T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ).
% 0.44/0.61
% 0.44/0.61 cnf(cls_PropLog_Oweaken__right_0,axiom,
% 0.44/0.61 ( ~ c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))
% 0.44/0.61 | 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.44/0.61
% 0.44/0.61 %------------------------------------------------------------------------------
% 0.44/0.61 %-------------------------------------------
% 0.44/0.61 % Proof found
% 0.44/0.61 % SZS status Theorem for theBenchmark
% 0.44/0.61 % SZS output start Proof
% 0.44/0.62 %ClaNum:3(EqnAxiom:0)
% 0.44/0.62 %VarNum:26(SingletonVarNum:9)
% 0.44/0.62 %MaxLitNum:2
% 0.44/0.62 %MaxfuncDepth:4
% 0.44/0.62 %SharedTerms:16
% 0.44/0.62 %goalClause: 2
% 0.44/0.62 %singleGoalClaCount:1
% 0.44/0.62 [2]~P1(f1(a5,f1(f1(a7,f1(a8,a9,a4),a4),f1(f1(a7,a8,a4),f1(a7,a9,a4),a4),a4),a4),f2(a6,a4),f3(a4))
% 0.44/0.62 [1]P1(f1(f1(x11,f1(x12,x13,x14),x14),f1(f1(x11,x12,x14),f1(x11,x13,x14),x14),x14),f2(x15,x14),f3(x14))
% 0.44/0.62 [3]P1(f1(x31,x32,x33),f2(x34,x33),f3(x33))+~P1(x32,f2(x34,x33),f3(x33))
% 0.44/0.62 %EqnAxiom
% 0.44/0.62
% 0.44/0.62 %-------------------------------------------
% 0.44/0.62 cnf(4,plain,
% 0.44/0.62 ($false),
% 0.44/0.62 inference(scs_inference,[],[2,1,3]),
% 0.44/0.62 ['proof']).
% 0.44/0.62 % SZS output end Proof
% 0.44/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------