TSTP Solution File: LCL432-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL432-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 : n024.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.20s 0.68s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL432-2 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n024.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 17:51:09 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.63 start to proof:theBenchmark
% 0.20/0.67 %-------------------------------------------
% 0.20/0.67 % File :CSE---1.6
% 0.20/0.67 % Problem :theBenchmark
% 0.20/0.67 % Transform :cnf
% 0.20/0.67 % Format :tptp:raw
% 0.20/0.67 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.67
% 0.20/0.67 % Result :Theorem 0.000000s
% 0.20/0.67 % Output :CNFRefutation 0.000000s
% 0.20/0.67 %-------------------------------------------
% 0.20/0.68 %------------------------------------------------------------------------------
% 0.20/0.68 % File : LCL432-2 : TPTP v8.1.2. Released v3.2.0.
% 0.20/0.68 % Domain : Logic Calculi (Propositional)
% 0.20/0.68 % Problem : Problem about propositional logic
% 0.20/0.68 % Version : [Pau06] axioms : Reduced > Especial.
% 0.20/0.68 % English :
% 0.20/0.68
% 0.20/0.68 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.20/0.68 % Source : [Pau06]
% 0.20/0.68 % Names :
% 0.20/0.68
% 0.20/0.68 % Status : Unsatisfiable
% 0.20/0.68 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.20/0.68 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 3 RR)
% 0.20/0.68 % Number of literals : 4 ( 0 equ; 2 neg)
% 0.20/0.68 % Maximal clause size : 2 ( 1 avg)
% 0.20/0.68 % Maximal term depth : 2 ( 1 avg)
% 0.20/0.68 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty)
% 0.20/0.68 % Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% 0.20/0.68 % Number of variables : 2 ( 0 sgn)
% 0.20/0.68 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.68
% 0.20/0.68 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.20/0.68 % of which only a small selection are required for the refutation.
% 0.20/0.68 % The mission is to find those few axioms, after which a refutation
% 0.20/0.68 % can be quite easily found. This version has only the necessary
% 0.20/0.68 % axioms.
% 0.20/0.68 %------------------------------------------------------------------------------
% 0.20/0.68 cnf(cls_conjecture_0,negated_conjecture,
% 0.20/0.68 c_PropLog_Osat(c_emptyset,v_x,t_a) ).
% 0.20/0.68
% 0.20/0.68 cnf(cls_conjecture_1,negated_conjecture,
% 0.20/0.68 ~ c_in(v_x,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)) ).
% 0.20/0.68
% 0.20/0.68 cnf(cls_PropLog_Ocompleteness__0_0,axiom,
% 0.20/0.68 ( ~ c_PropLog_Osat(c_emptyset,V_p,T_a)
% 0.20/0.68 | c_in(V_p,c_PropLog_Othms(c_emptyset,T_a),tc_PropLog_Opl(T_a)) ) ).
% 0.20/0.68
% 0.20/0.68 %------------------------------------------------------------------------------
% 0.20/0.68 %-------------------------------------------
% 0.20/0.68 % Proof found
% 0.20/0.68 % SZS status Theorem for theBenchmark
% 0.20/0.68 % SZS output start Proof
% 0.20/0.68 %ClaNum:3(EqnAxiom:0)
% 0.20/0.68 %VarNum:5(SingletonVarNum:2)
% 0.20/0.68 %MaxLitNum:2
% 0.20/0.68 %MaxfuncDepth:1
% 0.20/0.68 %SharedTerms:7
% 0.20/0.68 %goalClause: 1 2
% 0.20/0.68 %singleGoalClaCount:2
% 0.20/0.68 [1]P1(a1,a3,a4)
% 0.20/0.68 [2]~P2(a3,f2(a1,a4),f5(a4))
% 0.20/0.68 [3]~P1(a1,x31,x32)+P2(x31,f2(a1,x32),f5(x32))
% 0.20/0.68 %EqnAxiom
% 0.20/0.68
% 0.20/0.68 %-------------------------------------------
% 0.20/0.68 cnf(4,plain,
% 0.20/0.68 ($false),
% 0.20/0.68 inference(scs_inference,[],[1,2,3]),
% 0.20/0.68 ['proof']).
% 0.20/0.68 % SZS output end Proof
% 0.20/0.68 % Total time :0.000000s
%------------------------------------------------------------------------------