TSTP Solution File: SYN041-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN041-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n031.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:43:47 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.12/0.13 % Problem : SYN041-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n031.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 : Sat Aug 26 20:08:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.59 start to proof:theBenchmark
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % File :CSE---1.6
% 0.20/0.63 % Problem :theBenchmark
% 0.20/0.63 % Transform :cnf
% 0.20/0.63 % Format :tptp:raw
% 0.20/0.63 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.63
% 0.20/0.63 % Result :Theorem 0.000000s
% 0.20/0.63 % Output :CNFRefutation 0.000000s
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 % File : SYN041-1 : TPTP v8.1.2. Released v1.0.0.
% 0.20/0.63 % Domain : Syntactic
% 0.20/0.63 % Problem : Pelletier Problem 3, 16
% 0.20/0.63 % Version : Especial.
% 0.20/0.63 % English : 3: The hardest theorm proved by a breadth-first logic
% 0.20/0.63 % theorist.
% 0.20/0.63 % 16:A surprising theorem of propositional logic.
% 0.20/0.63
% 0.20/0.63 % Refs : [SRM73] Siklossy et al. (1973), Breadth First Search: Some Sur
% 0.20/0.63 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.20/0.63 % Source : [Pel86]
% 0.20/0.63 % Names : Pelletier 3 [Pel86]
% 0.20/0.63 % : Pelletier 16 [Pel86]
% 0.20/0.63
% 0.20/0.63 % Status : Unsatisfiable
% 0.20/0.63 % Rating : 0.00 v2.0.0
% 0.20/0.63 % Syntax : Number of clauses : 4 ( 4 unt; 0 nHn; 4 RR)
% 0.20/0.63 % Number of literals : 4 ( 0 equ; 2 neg)
% 0.20/0.63 % Maximal clause size : 1 ( 1 avg)
% 0.20/0.63 % Maximal term depth : 0 ( 0 avg)
% 0.20/0.63 % Number of predicates : 2 ( 2 usr; 2 prp; 0-0 aty)
% 0.20/0.63 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.20/0.63 % Number of variables : 0 ( 0 sgn)
% 0.20/0.63 % SPC : CNF_UNS_PRP
% 0.20/0.63
% 0.20/0.63 % Comments :
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 cnf(clause_1,negated_conjecture,
% 0.20/0.63 p ).
% 0.20/0.63
% 0.20/0.63 cnf(clause_2,negated_conjecture,
% 0.20/0.63 ~ q ).
% 0.20/0.63
% 0.20/0.63 cnf(clause_3,negated_conjecture,
% 0.20/0.63 q ).
% 0.20/0.63
% 0.20/0.63 cnf(clause_4,negated_conjecture,
% 0.20/0.63 ~ p ).
% 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.64 %ClaNum:4(EqnAxiom:0)
% 0.20/0.64 %VarNum:0(SingletonVarNum:0)
% 0.20/0.64 %MaxLitNum:1
% 0.20/0.64 %MaxfuncDepth:0
% 0.20/0.64 %SharedTerms:5
% 0.20/0.64 %goalClause: 1 2 3 4
% 0.20/0.64 %singleGoalClaCount:4
% 0.20/0.64 [1]P1(a500)
% 0.20/0.64 [2]P2(a500)
% 0.20/0.64 [3]~P1(a500)
% 0.20/0.64 [4]~P2(a500)
% 0.20/0.64 %EqnAxiom
% 0.20/0.64
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 cnf(5,plain,
% 0.20/0.64 ($false),
% 0.20/0.64 inference(scs_inference,[],[1,3]),
% 0.20/0.64 ['proof']).
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time :0.000000s
%------------------------------------------------------------------------------