TSTP Solution File: COL120-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : COL120-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 : 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:51 EDT 2023
% Result : Unsatisfiable 0.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : COL120-2 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n005.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 : Sun Aug 27 05:52:53 EDT 2023
% 0.13/0.35 % 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 : COL120-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.15 v5.2.0, 0.00 v3.2.0
% 0.20/0.62 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 2 RR)
% 0.20/0.62 % Number of literals : 4 ( 0 equ; 2 neg)
% 0.20/0.62 % Maximal clause size : 2 ( 1 avg)
% 0.20/0.62 % Maximal term depth : 2 ( 1 avg)
% 0.20/0.62 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% 0.20/0.62 % Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% 0.20/0.62 % Number of variables : 4 ( 1 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_x,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_conjecture_2,negated_conjecture,
% 0.20/0.62 ( ~ c_in(c_Pair(v_x,V_U,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
% 0.20/0.62 | ~ c_in(c_Pair(v_y,V_U,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_Transitive__Closure_Ortrancl_Ortrancl__refl_0,axiom,
% 0.20/0.62 c_in(c_Pair(V_a,V_a,T_a,T_a),c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a)) ).
% 0.20/0.62
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % Proof found
% 0.20/0.62 % SZS status Theorem for theBenchmark
% 0.20/0.62 % SZS output start Proof
% 0.20/0.62 %ClaNum:3(EqnAxiom:0)
% 0.20/0.62 %VarNum:10(SingletonVarNum:4)
% 0.20/0.62 %MaxLitNum:2
% 0.20/0.62 %MaxfuncDepth:1
% 0.20/0.62 %SharedTerms:8
% 0.20/0.62 %goalClause: 1 3
% 0.20/0.62 %singleGoalClaCount:1
% 0.20/0.62 [1]P1(f4(a1,a2,a3,a3),f5(a6,a3),f7(a3,a3))
% 0.20/0.62 [2]P1(f4(x21,x21,x22,x22),f5(x23,x22),f7(x22,x22))
% 0.20/0.62 [3]~P1(f4(a2,x31,a3,a3),f5(a6,a3),f7(a3,a3))+~P1(f4(a1,x31,a3,a3),f5(a6,a3),f7(a3,a3))
% 0.20/0.62 %EqnAxiom
% 0.20/0.62
% 0.20/0.62 %-------------------------------------------
% 0.20/0.63 cnf(4,plain,
% 0.20/0.63 ($false),
% 0.20/0.63 inference(scs_inference,[],[2,1,3]),
% 0.20/0.63 ['proof']).
% 0.20/0.63 % SZS output end Proof
% 0.20/0.63 % Total time :0.000000s
%------------------------------------------------------------------------------