TSTP Solution File: COL102-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : COL102-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 : n005.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:44 EDT 2023
% Result : Unsatisfiable 0.20s 0.63s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL102-2 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n005.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:36:23 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.57 start to proof:theBenchmark
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % File :CSE---1.6
% 0.20/0.62 % Problem :theBenchmark
% 0.20/0.62 % Transform :cnf
% 0.20/0.62 % Format :tptp:raw
% 0.20/0.62 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.62
% 0.20/0.62 % Result :Theorem 0.000000s
% 0.20/0.62 % Output :CNFRefutation 0.000000s
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 % File : COL102-2 : TPTP v8.1.2. Released v3.2.0.
% 0.20/0.62 % Domain : Combinatory Logic
% 0.20/0.62 % Problem : Problem about combinators
% 0.20/0.62 % Version : [Pau06] axioms : Reduced > Especial.
% 0.20/0.62 % English :
% 0.20/0.62
% 0.20/0.62 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.20/0.62 % Source : [Pau06]
% 0.20/0.62 % Names :
% 0.20/0.62
% 0.20/0.62 % Status : Unsatisfiable
% 0.20/0.62 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.20/0.62 % Syntax : Number of clauses : 6 ( 3 unt; 0 nHn; 5 RR)
% 0.20/0.62 % Number of literals : 10 ( 0 equ; 5 neg)
% 0.20/0.62 % Maximal clause size : 3 ( 1 avg)
% 0.20/0.62 % Maximal term depth : 3 ( 1 avg)
% 0.20/0.62 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% 0.20/0.62 % Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% 0.20/0.62 % Number of variables : 11 ( 0 sgn)
% 0.20/0.62 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.62
% 0.20/0.62 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.20/0.62 % of which only a small selection are required for the refutation.
% 0.20/0.62 % The mission is to find those few axioms, after which a refutation
% 0.20/0.62 % can be quite easily found. This version has only the necessary
% 0.20/0.62 % axioms.
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 cnf(cls_conjecture_1,negated_conjecture,
% 0.20/0.62 c_in(c_Pair(v_y,v_za,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_conjecture_2,negated_conjecture,
% 0.20/0.62 c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_y,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_conjecture_3,negated_conjecture,
% 0.20/0.62 ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_za,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_Comb_Ocontract_OAp1_0,axiom,
% 0.20/0.62 ( ~ c_in(c_Pair(V_x,V_y,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
% 0.20/0.62 | c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(V_x,V_z),c_Comb_Ocomb_Oop_A_D_D(V_y,V_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ) ).
% 0.20/0.63
% 0.20/0.63 cnf(cls_Transitive__Closure_Or__into__rtrancl_0,axiom,
% 0.20/0.63 ( ~ c_in(V_p,V_r,tc_prod(T_a,T_a))
% 0.20/0.63 | c_in(V_p,c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a)) ) ).
% 0.20/0.63
% 0.20/0.63 cnf(cls_Transitive__Closure_Ortrancl__trans_0,axiom,
% 0.20/0.63 ( ~ c_in(c_Pair(V_b,V_c,T_a,T_a),c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a))
% 0.20/0.63 | ~ c_in(c_Pair(V_a,V_b,T_a,T_a),c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a))
% 0.20/0.63 | c_in(c_Pair(V_a,V_c,T_a,T_a),c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a)) ) ).
% 0.20/0.63
% 0.20/0.63 %------------------------------------------------------------------------------
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % Proof found
% 0.20/0.63 % SZS status Theorem for theBenchmark
% 0.20/0.63 % SZS output start Proof
% 0.20/0.63 %ClaNum:6(EqnAxiom:0)
% 0.20/0.63 %VarNum:39(SingletonVarNum:11)
% 0.20/0.63 %MaxLitNum:3
% 0.20/0.63 %MaxfuncDepth:2
% 0.20/0.63 %SharedTerms:17
% 0.20/0.63 %goalClause: 1 2 3
% 0.20/0.63 %singleGoalClaCount:3
% 0.20/0.63 [1]P1(f3(a1,a9,a2,a2),a4,f7(a2,a2))
% 0.20/0.63 [2]P1(f3(f5(a8,a10),f5(a1,a10),a2,a2),f6(a4,a2),f7(a2,a2))
% 0.20/0.63 [3]~P1(f3(f5(a8,a10),f5(a9,a10),a2,a2),f6(a4,a2),f7(a2,a2))
% 0.20/0.63 [4]~P1(x41,x42,f7(x43,x43))+P1(x41,f6(x42,x43),f7(x43,x43))
% 0.20/0.63 [5]~P1(f3(x51,x53,a2,a2),a4,f7(a2,a2))+P1(f3(f5(x51,x52),f5(x53,x52),a2,a2),a4,f7(a2,a2))
% 0.20/0.63 [6]P1(f3(x61,x62,x63,x63),f6(x64,x63),f7(x63,x63))+~P1(f3(x65,x62,x63,x63),f6(x64,x63),f7(x63,x63))+~P1(f3(x61,x65,x63,x63),f6(x64,x63),f7(x63,x63))
% 0.20/0.63 %EqnAxiom
% 0.20/0.63
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 cnf(8,plain,
% 0.20/0.63 (~P1(f3(f5(a1,a10),f5(a9,a10),a2,a2),f6(a4,a2),f7(a2,a2))),
% 0.20/0.63 inference(scs_inference,[],[3,2,4,6])).
% 0.20/0.63 cnf(9,plain,
% 0.20/0.63 (P1(f3(f5(a1,x91),f5(a9,x91),a2,a2),a4,f7(a2,a2))),
% 0.20/0.63 inference(scs_inference,[],[1,3,2,4,6,5])).
% 0.20/0.63 cnf(18,plain,
% 0.20/0.63 ($false),
% 0.20/0.63 inference(scs_inference,[],[8,9,4]),
% 0.20/0.63 ['proof']).
% 0.20/0.63 % SZS output end Proof
% 0.20/0.63 % Total time :0.000000s
%------------------------------------------------------------------------------