TSTP Solution File: COL112-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : COL112-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 : n003.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 : Wed Aug 30 18:21:48 EDT 2023
% Result : Unsatisfiable 0.19s 0.60s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL112-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.34 % Computer : n003.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 : Sun Aug 27 04:26:54 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.55 start to proof:theBenchmark
% 0.19/0.59 %-------------------------------------------
% 0.19/0.59 % File :CSE---1.6
% 0.19/0.59 % Problem :theBenchmark
% 0.19/0.59 % Transform :cnf
% 0.19/0.59 % Format :tptp:raw
% 0.19/0.59 % Command :java -jar mcs_scs.jar %d %s
% 0.19/0.59
% 0.19/0.59 % Result :Theorem 0.000000s
% 0.19/0.59 % Output :CNFRefutation 0.000000s
% 0.19/0.59 %-------------------------------------------
% 0.19/0.59 %------------------------------------------------------------------------------
% 0.19/0.59 % File : COL112-2 : TPTP v8.1.2. Released v3.2.0.
% 0.19/0.59 % Domain : Combinatory Logic
% 0.19/0.59 % Problem : Problem about combinators
% 0.19/0.59 % Version : [Pau06] axioms : Reduced > Especial.
% 0.19/0.59 % English :
% 0.19/0.59
% 0.19/0.59 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.19/0.59 % Source : [Pau06]
% 0.19/0.59 % Names :
% 0.19/0.59
% 0.19/0.59 % Status : Unsatisfiable
% 0.19/0.59 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.19/0.59 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 1 RR)
% 0.19/0.59 % Number of literals : 4 ( 0 equ; 2 neg)
% 0.19/0.59 % Maximal clause size : 2 ( 1 avg)
% 0.19/0.59 % Maximal term depth : 4 ( 1 avg)
% 0.19/0.59 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% 0.19/0.59 % Number of functors : 8 ( 8 usr; 5 con; 0-4 aty)
% 0.19/0.59 % Number of variables : 4 ( 1 sgn)
% 0.19/0.59 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.19/0.59
% 0.19/0.59 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.19/0.59 % of which only a small selection are required for the refutation.
% 0.19/0.59 % The mission is to find those few axioms, after which a refutation
% 0.19/0.59 % can be quite easily found. This version has only the necessary
% 0.19/0.59 % axioms.
% 0.19/0.60 %------------------------------------------------------------------------------
% 0.19/0.60 cnf(cls_conjecture_0,negated_conjecture,
% 0.19/0.60 ( ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x),v_ya),V_U,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
% 0.19/0.60 | ~ c_in(c_Pair(v_x,V_U,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ) ).
% 0.19/0.60
% 0.19/0.60 cnf(cls_Comb_Oparcontract_Ointros__1_0,axiom,
% 0.19/0.60 c_in(c_Pair(V_x,V_x,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ).
% 0.19/0.60
% 0.19/0.60 cnf(cls_Comb_Oparcontract_Ointros__2_0,axiom,
% 0.19/0.60 c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,V_x),V_y),V_x,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ).
% 0.19/0.60
% 0.19/0.60 %------------------------------------------------------------------------------
% 0.19/0.60 %-------------------------------------------
% 0.19/0.60 % Proof found
% 0.19/0.60 % SZS status Theorem for theBenchmark
% 0.19/0.60 % SZS output start Proof
% 0.19/0.60 %ClaNum:3(EqnAxiom:0)
% 0.19/0.60 %VarNum:7(SingletonVarNum:4)
% 0.19/0.60 %MaxLitNum:2
% 0.19/0.60 %MaxfuncDepth:3
% 0.19/0.60 %SharedTerms:8
% 0.19/0.60 %goalClause: 3
% 0.19/0.60 [1]P1(f2(x11,x11,a1,a1),a3,f6(a1,a1))
% 0.19/0.60 [2]P1(f2(f5(f5(a4,x21),x22),x21,a1,a1),a3,f6(a1,a1))
% 0.19/0.60 [3]~P1(f2(a7,x31,a1,a1),a3,f6(a1,a1))+~P1(f2(f5(f5(a4,a7),a8),x31,a1,a1),a3,f6(a1,a1))
% 0.19/0.60 %EqnAxiom
% 0.19/0.60
% 0.19/0.60 %-------------------------------------------
% 0.19/0.60 cnf(4,plain,
% 0.19/0.60 ($false),
% 0.19/0.60 inference(scs_inference,[],[1,2,3]),
% 0.19/0.60 ['proof']).
% 0.19/0.60 % SZS output end Proof
% 0.19/0.60 % Total time :0.000000s
%------------------------------------------------------------------------------