TSTP Solution File: SYN327-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN327-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n006.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:45:12 EDT 2023
% Result : Unsatisfiable 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN327-1 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 22:18:37 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.53 start to proof:theBenchmark
% 0.19/0.56 %-------------------------------------------
% 0.19/0.56 % File :CSE---1.6
% 0.19/0.56 % Problem :theBenchmark
% 0.19/0.56 % Transform :cnf
% 0.19/0.56 % Format :tptp:raw
% 0.19/0.56 % Command :java -jar mcs_scs.jar %d %s
% 0.19/0.56
% 0.19/0.56 % Result :Theorem 0.000000s
% 0.19/0.56 % Output :CNFRefutation 0.000000s
% 0.19/0.56 %-------------------------------------------
% 0.19/0.56 %--------------------------------------------------------------------------
% 0.19/0.56 % File : SYN327-1 : TPTP v8.1.2. Released v1.2.0.
% 0.19/0.56 % Domain : Syntactic
% 0.19/0.56 % Problem : Church problem 46.12 (2)
% 0.19/0.56 % Version : Especial.
% 0.19/0.56 % English :
% 0.19/0.56
% 0.19/0.56 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I
% 0.19/0.56 % : [FL+93] Fermuller et al. (1993), Resolution Methods for the De
% 0.19/0.56 % : [Tam94] Tammet (1994), Email to Geoff Sutcliffe.
% 0.19/0.56 % Source : [Tam94]
% 0.19/0.56 % Names : Ch12N2 [Tam94]
% 0.19/0.56
% 0.19/0.56 % Status : Unsatisfiable
% 0.19/0.56 % Rating : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.14 v6.2.0, 0.00 v2.0.0
% 0.19/0.56 % Syntax : Number of clauses : 6 ( 0 unt; 2 nHn; 4 RR)
% 0.19/0.56 % Number of literals : 14 ( 0 equ; 8 neg)
% 0.19/0.56 % Maximal clause size : 3 ( 2 avg)
% 0.19/0.57 % Maximal term depth : 2 ( 1 avg)
% 0.19/0.57 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty)
% 0.19/0.57 % Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% 0.19/0.57 % Number of variables : 6 ( 0 sgn)
% 0.19/0.57 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.19/0.57
% 0.19/0.57 % Comments : All the problems here can be decided by using a certain
% 0.19/0.57 % completeness-preserving term ordering strategies. See [FL+93].
% 0.19/0.57 % : The conversion from the full 1st order form in [Chu56]
% 0.19/0.57 % to clause form was done by hand by Tanel Tammet.
% 0.19/0.57 %--------------------------------------------------------------------------
% 0.19/0.57 cnf(clause1,negated_conjecture,
% 0.19/0.57 ( f(Y,a)
% 0.19/0.57 | f(a,Y) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause2,negated_conjecture,
% 0.19/0.57 ( f(Y,a)
% 0.19/0.57 | ~ f(a,z(Y)) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause3,negated_conjecture,
% 0.19/0.57 ( f(a,z(Y))
% 0.19/0.57 | f(a,Y) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause4,negated_conjecture,
% 0.19/0.57 ( f(a,z(Y))
% 0.19/0.57 | ~ f(Y,a)
% 0.19/0.57 | ~ f(z(Y),Y) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause5,negated_conjecture,
% 0.19/0.57 ( ~ f(a,Y)
% 0.19/0.57 | ~ f(a,z(Y)) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause6,negated_conjecture,
% 0.19/0.57 ( ~ f(a,Y)
% 0.19/0.57 | ~ f(Y,a)
% 0.19/0.57 | ~ f(z(Y),Y) ) ).
% 0.19/0.57
% 0.19/0.57 %--------------------------------------------------------------------------
% 0.19/0.57 %-------------------------------------------
% 0.19/0.57 % Proof found
% 0.19/0.57 % SZS status Theorem for theBenchmark
% 0.19/0.57 % SZS output start Proof
% 0.19/0.57 %ClaNum:6(EqnAxiom:0)
% 0.19/0.57 %VarNum:16(SingletonVarNum:6)
% 0.19/0.57 %MaxLitNum:3
% 0.19/0.57 %MaxfuncDepth:1
% 0.19/0.57 %SharedTerms:1
% 0.19/0.57 %goalClause: 1 2 3 4 5 6
% 0.19/0.57 [1]P1(a1,x11)+P1(x11,a1)
% 0.19/0.57 [2]P1(a1,x21)+P1(a1,f2(x21))
% 0.19/0.57 [3]P1(x31,a1)+~P1(a1,f2(x31))
% 0.19/0.57 [4]~P1(a1,x41)+~P1(a1,f2(x41))
% 0.19/0.57 [5]~P1(x51,a1)+~P1(f2(x51),x51)+P1(a1,f2(x51))
% 0.19/0.57 [6]~P1(a1,x61)+~P1(f2(x61),x61)+~P1(x61,a1)
% 0.19/0.57 %EqnAxiom
% 0.19/0.57
% 0.19/0.57 %-------------------------------------------
% 0.19/0.57 cnf(7,plain,
% 0.19/0.57 (~P1(a1,f2(a1))),
% 0.19/0.57 inference(scs_inference,[],[1,4])).
% 0.19/0.57 cnf(12,plain,
% 0.19/0.57 ($false),
% 0.19/0.57 inference(scs_inference,[],[7,2,5,1]),
% 0.19/0.57 ['proof']).
% 0.19/0.57 % SZS output end Proof
% 0.19/0.57 % Total time :0.000000s
%------------------------------------------------------------------------------