TSTP Solution File: LCL441-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL441-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 : n013.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:20 EDT 2023
% Result : Unsatisfiable 0.20s 0.61s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL441-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 : Fri Aug 25 00:09:02 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.56 start to proof:theBenchmark
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % File :CSE---1.6
% 0.20/0.61 % Problem :theBenchmark
% 0.20/0.61 % Transform :cnf
% 0.20/0.61 % Format :tptp:raw
% 0.20/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.61
% 0.20/0.61 % Result :Theorem 0.000000s
% 0.20/0.61 % Output :CNFRefutation 0.000000s
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 %------------------------------------------------------------------------------
% 0.20/0.61 % File : LCL441-2 : TPTP v8.1.2. Released v3.2.0.
% 0.20/0.61 % Domain : Logic Calculi (Propositional)
% 0.20/0.61 % Problem : Problem about propositional logic
% 0.20/0.61 % Version : [Pau06] axioms : Reduced > Especial.
% 0.20/0.61 % English :
% 0.20/0.61
% 0.20/0.61 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.20/0.61 % Source : [Pau06]
% 0.20/0.61 % Names :
% 0.20/0.61
% 0.20/0.61 % Status : Unsatisfiable
% 0.20/0.61 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.20/0.61 % Syntax : Number of clauses : 3 ( 1 unt; 0 nHn; 2 RR)
% 0.20/0.61 % Number of literals : 5 ( 0 equ; 3 neg)
% 0.20/0.61 % Maximal clause size : 2 ( 1 avg)
% 0.20/0.61 % Maximal term depth : 5 ( 2 avg)
% 0.20/0.61 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% 0.20/0.61 % Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% 0.20/0.61 % Number of variables : 6 ( 1 sgn)
% 0.20/0.61 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.61
% 0.20/0.61 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.20/0.61 % of which only a small selection are required for the refutation.
% 0.20/0.61 % The mission is to find those few axioms, after which a refutation
% 0.20/0.61 % can be quite easily found. This version has only the necessary
% 0.20/0.61 % axioms.
% 0.20/0.61 %------------------------------------------------------------------------------
% 0.20/0.61 cnf(cls_conjecture_3,negated_conjecture,
% 0.20/0.61 ( ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
% 0.20/0.61 | ~ c_in(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Ovar(v_a,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(cls_PropLog_Othms_OH_0,axiom,
% 0.20/0.61 ( ~ c_in(V_p,V_H,tc_PropLog_Opl(T_a))
% 0.20/0.61 | c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(cls_Set_OinsertCI_1,axiom,
% 0.20/0.61 c_in(V_x,c_insert(V_x,V_B,T_a),T_a) ).
% 0.20/0.61
% 0.20/0.61 %------------------------------------------------------------------------------
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % Proof found
% 0.20/0.61 % SZS status Theorem for theBenchmark
% 0.20/0.61 % SZS output start Proof
% 0.20/0.61 %ClaNum:3(EqnAxiom:0)
% 0.20/0.61 %VarNum:12(SingletonVarNum:6)
% 0.20/0.61 %MaxLitNum:2
% 0.20/0.61 %MaxfuncDepth:3
% 0.20/0.61 %SharedTerms:13
% 0.20/0.61 %goalClause: 3
% 0.20/0.61 [1]P1(x11,f1(x11,x12,x13),x13)
% 0.20/0.61 [3]~P1(f5(f3(a9,a8),a4,a8),f2(f1(f5(f3(a9,a8),a4,a8),a6,f7(a8)),a8),f7(a8))+~P1(f3(a9,a8),f2(f1(f3(a9,a8),a6,f7(a8)),a8),f7(a8))
% 0.20/0.61 [2]~P1(x21,x22,f7(x23))+P1(x21,f2(x22,x23),f7(x23))
% 0.20/0.61 %EqnAxiom
% 0.20/0.61
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 cnf(4,plain,
% 0.20/0.62 (P1(x41,f2(f1(x41,x42,f7(x43)),x43),f7(x43))),
% 0.20/0.62 inference(scs_inference,[],[1,2])).
% 0.20/0.62 cnf(6,plain,
% 0.20/0.62 (~P1(f3(a9,a8),f2(f1(f3(a9,a8),a6,f7(a8)),a8),f7(a8))),
% 0.20/0.62 inference(scs_inference,[],[1,2,3])).
% 0.20/0.62 cnf(7,plain,
% 0.20/0.62 ($false),
% 0.20/0.62 inference(scs_inference,[],[4,6]),
% 0.20/0.62 ['proof']).
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------