TSTP Solution File: LCL447-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL447-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 : n015.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:23 EDT 2023
% Result : Unsatisfiable 0.15s 0.58s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL447-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.10/0.31 % Computer : n015.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri Aug 25 05:20:21 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.53 start to proof:theBenchmark
% 0.15/0.58 %-------------------------------------------
% 0.15/0.58 % File :CSE---1.6
% 0.15/0.58 % Problem :theBenchmark
% 0.15/0.58 % Transform :cnf
% 0.15/0.58 % Format :tptp:raw
% 0.15/0.58 % Command :java -jar mcs_scs.jar %d %s
% 0.15/0.58
% 0.15/0.58 % Result :Theorem 0.000000s
% 0.15/0.58 % Output :CNFRefutation 0.000000s
% 0.15/0.58 %-------------------------------------------
% 0.15/0.58 %------------------------------------------------------------------------------
% 0.15/0.58 % File : LCL447-2 : TPTP v8.1.2. Released v3.2.0.
% 0.15/0.58 % Domain : Logic Calculi (Propositional)
% 0.15/0.58 % Problem : Problem about propositional logic
% 0.15/0.58 % Version : [Pau06] axioms : Reduced > Especial.
% 0.15/0.58 % English :
% 0.15/0.58
% 0.15/0.58 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.15/0.58 % Source : [Pau06]
% 0.15/0.58 % Names :
% 0.15/0.58
% 0.15/0.58 % Status : Unsatisfiable
% 0.15/0.58 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.15/0.58 % Syntax : Number of clauses : 4 ( 3 unt; 0 nHn; 3 RR)
% 0.15/0.58 % Number of literals : 6 ( 0 equ; 3 neg)
% 0.15/0.58 % Maximal clause size : 3 ( 1 avg)
% 0.15/0.58 % Maximal term depth : 3 ( 1 avg)
% 0.15/0.58 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% 0.15/0.58 % Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% 0.15/0.58 % Number of variables : 8 ( 2 sgn)
% 0.15/0.58 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.15/0.58
% 0.15/0.58 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.15/0.58 % of which only a small selection are required for the refutation.
% 0.15/0.58 % The mission is to find those few axioms, after which a refutation
% 0.15/0.58 % can be quite easily found. This version has only the necessary
% 0.15/0.58 % axioms.
% 0.15/0.58 %------------------------------------------------------------------------------
% 0.15/0.58 cnf(cls_conjecture_0,negated_conjecture,
% 0.15/0.58 c_in(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ).
% 0.15/0.58
% 0.15/0.58 cnf(cls_conjecture_1,negated_conjecture,
% 0.15/0.58 ~ 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.15/0.58
% 0.15/0.58 cnf(cls_PropLog_Othms_OK_0,axiom,
% 0.15/0.58 c_in(c_PropLog_Opl_Oop_A_N_62(V_p,c_PropLog_Opl_Oop_A_N_62(V_q,V_p,T_a),T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ).
% 0.15/0.58
% 0.15/0.58 cnf(cls_PropLog_Othms_OMP_0,axiom,
% 0.15/0.58 ( ~ c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))
% 0.15/0.58 | ~ 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.15/0.58 | c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ).
% 0.15/0.58
% 0.15/0.58 %------------------------------------------------------------------------------
% 0.15/0.58 %-------------------------------------------
% 0.15/0.58 % Proof found
% 0.15/0.58 % SZS status Theorem for theBenchmark
% 0.15/0.58 % SZS output start Proof
% 0.15/0.58 %ClaNum:4(EqnAxiom:0)
% 0.15/0.58 %VarNum:22(SingletonVarNum:8)
% 0.15/0.58 %MaxLitNum:3
% 0.15/0.58 %MaxfuncDepth:2
% 0.15/0.58 %SharedTerms:9
% 0.15/0.58 %goalClause: 1 3
% 0.15/0.58 %singleGoalClaCount:2
% 0.15/0.58 [1]P1(a1,f4(a2,a3),f6(a3))
% 0.15/0.58 [3]~P1(f5(a7,a1,a3),f4(a2,a3),f6(a3))
% 0.15/0.58 [2]P1(f5(x21,f5(x22,x21,x23),x23),f4(x24,x23),f6(x23))
% 0.15/0.58 [4]~P1(f5(x44,x41,x43),f4(x42,x43),f6(x43))+P1(x41,f4(x42,x43),f6(x43))+~P1(x44,f4(x42,x43),f6(x43))
% 0.15/0.58 %EqnAxiom
% 0.15/0.58
% 0.15/0.58 %-------------------------------------------
% 0.15/0.58 cnf(5,plain,
% 0.15/0.58 ($false),
% 0.15/0.58 inference(scs_inference,[],[2,3,1,4]),
% 0.15/0.58 ['proof']).
% 0.15/0.58 % SZS output end Proof
% 0.15/0.58 % Total time :0.000000s
%------------------------------------------------------------------------------