TSTP Solution File: SYN095-1.002 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN095-1.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n004.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 : Fri Sep 1 01:44:10 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.00/0.12 % Problem : SYN095-1.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n004.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 21:02:53 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 : SYN095-1.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.20/0.61 % Domain : Syntactic
% 0.20/0.61 % Problem : Plaisted problem m(t(2,2))
% 0.20/0.61 % Version : Biased.
% 0.20/0.61 % English :
% 0.20/0.61
% 0.20/0.61 % Refs : [Pla94] Plaisted (1994), The Search Efficiency of Theorem Prov
% 0.20/0.61 % Source : [Pla94]
% 0.20/0.61 % Names : M(T2n) [Pla94]
% 0.20/0.61
% 0.20/0.61 % Status : Unsatisfiable
% 0.20/0.61 % Rating : 0.00 v2.1.0
% 0.20/0.61 % Syntax : Number of clauses : 13 ( 5 unt; 0 nHn; 13 RR)
% 0.20/0.61 % Number of literals : 25 ( 0 equ; 13 neg)
% 0.20/0.61 % Maximal clause size : 3 ( 1 avg)
% 0.20/0.61 % Maximal term depth : 1 ( 1 avg)
% 0.20/0.61 % Number of predicates : 6 ( 6 usr; 0 prp; 1-1 aty)
% 0.20/0.61 % Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% 0.20/0.61 % Number of variables : 9 ( 1 sgn)
% 0.20/0.61 % SPC : CNF_UNS_EPR_NEQ_HRN
% 0.20/0.61
% 0.20/0.61 % Comments : Biased away from various calculi.
% 0.20/0.61 % : tptp2X: -f tptp -s2 SYN095-1.g
% 0.20/0.61 % Bugfixes : v1.2.0 - Bugfix in SYN086-1.
% 0.20/0.61 % : v1.2.1 - Bugfix in SYN086-1.
% 0.20/0.61 %--------------------------------------------------------------------------
% 0.20/0.61 cnf(m_s2_goal_1,negated_conjecture,
% 0.20/0.61 ~ p_1_2(X) ).
% 0.20/0.61
% 0.20/0.61 cnf(m_s2_type11_1,axiom,
% 0.20/0.61 ( p_1_2(X)
% 0.20/0.61 | ~ p_2_2(X)
% 0.20/0.61 | ~ p_1_1(X) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(m_s2_type11_2,axiom,
% 0.20/0.61 ( p_1_2(X)
% 0.20/0.61 | ~ q_2_2(X)
% 0.20/0.61 | ~ q_1_1(X) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(m_s2_type12_1,axiom,
% 0.20/0.61 ( q_1_2(X)
% 0.20/0.61 | ~ p_2_2(X)
% 0.20/0.61 | ~ q_1_1(X) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(m_s2_type12_2,axiom,
% 0.20/0.62 ( q_1_2(X)
% 0.20/0.62 | ~ q_2_2(X)
% 0.20/0.62 | ~ p_1_1(X) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(m_s2_type21_1,axiom,
% 0.20/0.62 ( p_1_1(X)
% 0.20/0.62 | ~ p_1_2(X) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(m_s2_type21_2,axiom,
% 0.20/0.62 ( q_1_1(X)
% 0.20/0.62 | ~ q_1_2(X) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(m_s2_type22_1,axiom,
% 0.20/0.62 ( p_2_2(X)
% 0.20/0.62 | ~ p_1_2(X) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(m_s2_type22_2,axiom,
% 0.20/0.62 ( q_2_2(X)
% 0.20/0.62 | ~ q_1_2(X) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(m_t2_1,axiom,
% 0.20/0.62 p_1_1(a) ).
% 0.20/0.62
% 0.20/0.62 cnf(m_t2_2,axiom,
% 0.20/0.62 q_1_1(a) ).
% 0.20/0.62
% 0.20/0.62 cnf(m_t2_3,axiom,
% 0.20/0.62 p_2_2(a) ).
% 0.20/0.62
% 0.20/0.62 cnf(m_t2_4,axiom,
% 0.20/0.62 q_2_2(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:13(EqnAxiom:0)
% 0.20/0.62 %VarNum:17(SingletonVarNum:7)
% 0.20/0.62 %MaxLitNum:3
% 0.20/0.62 %MaxfuncDepth:0
% 0.20/0.62 %SharedTerms:5
% 0.20/0.62 %goalClause: 5
% 0.20/0.62 %singleGoalClaCount:1
% 0.20/0.62 [1]P1(a1)
% 0.20/0.62 [2]P2(a1)
% 0.20/0.62 [3]P4(a1)
% 0.20/0.62 [4]P5(a1)
% 0.20/0.62 [5]~P3(x51)
% 0.20/0.62 [8]~P6(x81)+P4(x81)
% 0.20/0.62 [9]~P6(x91)+P5(x91)
% 0.20/0.62 [10]~P1(x101)+~P2(x101)+P3(x101)
% 0.20/0.62 [11]~P4(x111)+~P5(x111)+P3(x111)
% 0.20/0.62 [12]~P1(x121)+~P5(x121)+P6(x121)
% 0.20/0.62 [13]~P2(x131)+~P4(x131)+P6(x131)
% 0.20/0.62 %EqnAxiom
% 0.20/0.62
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 cnf(14,plain,
% 0.20/0.62 ($false),
% 0.20/0.62 inference(scs_inference,[],[1,2,5,10]),
% 0.20/0.62 ['proof']).
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------