TSTP Solution File: LCL039-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL039-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 : n012.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 : Thu Aug 31 06:47:45 EDT 2023
% Result : Unsatisfiable 234.55s 234.52s
% Output : CNFRefutation 234.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL039-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 24 19:38:57 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.59 start to proof:theBenchmark
% 234.52/234.50 %-------------------------------------------
% 234.52/234.50 % File :CSE---1.6
% 234.52/234.50 % Problem :theBenchmark
% 234.52/234.50 % Transform :cnf
% 234.52/234.50 % Format :tptp:raw
% 234.52/234.50 % Command :java -jar mcs_scs.jar %d %s
% 234.52/234.50
% 234.52/234.50 % Result :Theorem 233.850000s
% 234.52/234.50 % Output :CNFRefutation 233.850000s
% 234.52/234.50 %-------------------------------------------
% 234.55/234.52 %--------------------------------------------------------------------------
% 234.55/234.52 % File : LCL039-1 : TPTP v8.1.2. Released v1.0.0.
% 234.55/234.52 % Domain : Logic Calculi (Implication/Negation 2 valued modal)
% 234.55/234.52 % Problem : A theorem from Morgan
% 234.55/234.52 % Version : [Pel86] axioms.
% 234.55/234.52 % English : An axiomatisation of the Implication/Negation 2 valued
% 234.55/234.52 % sentential calculus is {CN-18,CN-35,CN-49} by Church. This
% 234.55/234.52 % can be extended to the modal logic T by the addition
% 234.55/234.52 % of three axioms for the modal operators. This problem proves
% 234.55/234.52 % a simple result of T.
% 234.55/234.52
% 234.55/234.52 % Refs : [Mor84] Morgan (1984), Logic Problems
% 234.55/234.52 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 234.55/234.52 % Source : [Pel86]
% 234.55/234.52 % Names : Pelletier 69 [Pel86]
% 234.55/234.52
% 234.55/234.52 % Status : Unsatisfiable
% 234.55/234.52 % Rating : 0.14 v8.1.0, 0.25 v7.4.0, 0.17 v7.3.0, 0.25 v6.2.0, 0.17 v6.1.0, 0.29 v6.0.0, 0.11 v5.5.0, 0.31 v5.4.0, 0.28 v5.3.0, 0.35 v5.2.0, 0.15 v5.1.0, 0.31 v5.0.0, 0.20 v4.1.0, 0.33 v4.0.1, 0.00 v3.1.0, 0.17 v2.7.0, 0.38 v2.6.0, 0.29 v2.5.0, 0.00 v2.4.0, 0.00 v2.3.0, 0.14 v2.2.1, 0.56 v2.1.0, 0.63 v2.0.0
% 234.55/234.52 % Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 3 RR)
% 234.55/234.52 % Number of literals : 11 ( 0 equ; 4 neg)
% 234.55/234.52 % Maximal clause size : 3 ( 1 avg)
% 234.55/234.52 % Maximal term depth : 5 ( 2 avg)
% 234.55/234.52 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty)
% 234.55/234.52 % Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% 234.55/234.52 % Number of variables : 13 ( 1 sgn)
% 234.55/234.52 % SPC : CNF_UNS_RFO_NEQ_HRN
% 234.55/234.52
% 234.55/234.52 % Comments :
% 234.55/234.52 %--------------------------------------------------------------------------
% 234.55/234.52 cnf(condensed_detachment,axiom,
% 234.55/234.52 ( ~ is_a_theorem(implies(X,Y))
% 234.55/234.52 | ~ is_a_theorem(X)
% 234.55/234.52 | is_a_theorem(Y) ) ).
% 234.55/234.52
% 234.55/234.52 cnf(cn_18,axiom,
% 234.55/234.52 is_a_theorem(implies(X,implies(Y,X))) ).
% 234.55/234.52
% 234.55/234.52 cnf(cn_35,axiom,
% 234.55/234.52 is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))) ).
% 234.55/234.52
% 234.55/234.52 cnf(cn_49,axiom,
% 234.55/234.52 is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))) ).
% 234.55/234.52
% 234.55/234.52 cnf(necessitation1,axiom,
% 234.55/234.52 is_a_theorem(implies(necessary(implies(X,Y)),implies(necessary(X),necessary(Y)))) ).
% 234.55/234.52
% 234.55/234.52 cnf(necessitation2,axiom,
% 234.55/234.52 is_a_theorem(implies(necessary(X),X)) ).
% 234.55/234.52
% 234.55/234.52 cnf(axiom_of_necessitation,axiom,
% 234.55/234.52 ( ~ is_a_theorem(X)
% 234.55/234.52 | is_a_theorem(necessary(X)) ) ).
% 234.55/234.52
% 234.55/234.52 cnf(prove_this,negated_conjecture,
% 234.55/234.52 ~ is_a_theorem(implies(necessary(a),not(necessary(not(a))))) ).
% 234.55/234.52
% 234.55/234.52 %--------------------------------------------------------------------------
% 234.55/234.52 %-------------------------------------------
% 234.55/234.52 % Proof found
% 234.55/234.52 % SZS status Theorem for theBenchmark
% 234.55/234.52 % SZS output start Proof
% 234.57/234.53 %ClaNum:8(EqnAxiom:0)
% 234.57/234.53 %VarNum:26(SingletonVarNum:13)
% 234.57/234.53 %MaxLitNum:3
% 234.57/234.53 %MaxfuncDepth:4
% 234.57/234.53 %SharedTerms:7
% 234.57/234.53 %goalClause: 6
% 234.57/234.53 %singleGoalClaCount:1
% 234.57/234.53 [6]~P1(f2(f1(a3),f4(f1(f4(a3)))))
% 234.57/234.53 [1]P1(f2(f1(x11),x11))
% 234.57/234.53 [2]P1(f2(x21,f2(x22,x21)))
% 234.57/234.53 [3]P1(f2(f2(f4(x31),f4(x32)),f2(x32,x31)))
% 234.57/234.53 [4]P1(f2(f1(f2(x41,x42)),f2(f1(x41),f1(x42))))
% 234.57/234.53 [5]P1(f2(f2(x51,f2(x52,x53)),f2(f2(x51,x52),f2(x51,x53))))
% 234.57/234.53 [7]~P1(x71)+P1(f1(x71))
% 234.57/234.53 [8]P1(x81)+~P1(x82)+~P1(f2(x82,x81))
% 234.57/234.53 %EqnAxiom
% 234.57/234.53
% 234.57/234.53 %-------------------------------------------
% 234.57/234.55 cnf(19,plain,
% 234.57/234.55 (P1(f2(f1(x191),f1(f2(x192,x191))))),
% 234.57/234.55 inference(scs_inference,[],[2,4,7,8])).
% 234.57/234.55 cnf(20,plain,
% 234.57/234.55 (P1(f2(f2(x201,x202),f2(x201,x201)))),
% 234.57/234.55 inference(scs_inference,[],[2,5,8])).
% 234.57/234.55 cnf(40,plain,
% 234.57/234.55 (P1(f2(f1(x401),f1(x401)))),
% 234.57/234.55 inference(scs_inference,[],[19,20,8])).
% 234.57/234.55 cnf(67,plain,
% 234.57/234.55 (P1(f2(x671,f2(f1(x672),f1(x672))))),
% 234.57/234.55 inference(scs_inference,[],[40,2,8])).
% 234.57/234.55 cnf(119,plain,
% 234.57/234.55 (P1(f2(x1191,f2(f2(f4(x1192),f4(x1193)),f2(x1193,x1192))))),
% 234.57/234.55 inference(scs_inference,[],[3,2,7,8])).
% 234.57/234.55 cnf(131,plain,
% 234.57/234.55 (P1(f2(x1311,f2(f1(x1312),x1312)))),
% 234.57/234.55 inference(scs_inference,[],[1,4,2,7,8])).
% 234.57/234.55 cnf(135,plain,
% 234.57/234.55 (P1(f2(f2(x1351,f1(x1352)),f2(x1351,x1352)))),
% 234.57/234.55 inference(scs_inference,[],[131,5,8])).
% 234.57/234.55 cnf(190,plain,
% 234.57/234.55 (P1(f2(x1901,f2(f2(x1902,f2(x1903,x1904)),f2(f2(x1902,x1903),f2(x1902,x1904)))))),
% 234.57/234.55 inference(scs_inference,[],[5,2,8])).
% 234.57/234.55 cnf(212,plain,
% 234.57/234.55 (P1(f2(x2121,x2121))),
% 234.57/234.55 inference(scs_inference,[],[20,190,8])).
% 234.57/234.55 cnf(217,plain,
% 234.57/234.55 (P1(f2(f2(f2(x2171,x2172),x2171),f2(f2(x2171,x2172),x2172)))),
% 234.57/234.55 inference(scs_inference,[],[212,5,8])).
% 234.57/234.55 cnf(227,plain,
% 234.57/234.55 (P1(f2(f2(f2(f2(f4(x2271),f4(x2272)),f2(x2272,x2271)),x2273),x2273))),
% 234.57/234.55 inference(scs_inference,[],[217,119,8])).
% 234.57/234.55 cnf(248,plain,
% 234.57/234.55 (P1(f2(f2(x2481,f2(f4(x2482),f4(x2483))),f2(x2481,f2(x2483,x2482))))),
% 234.57/234.55 inference(scs_inference,[],[119,5,8])).
% 234.57/234.55 cnf(254,plain,
% 234.57/234.55 (P1(f2(f2(f2(f2(f4(x2541),f4(x2542)),f2(x2542,x2541)),f2(f4(x2543),f4(x2544))),f2(x2544,x2543)))),
% 234.57/234.55 inference(scs_inference,[],[227,248,8])).
% 234.57/234.55 cnf(336,plain,
% 234.57/234.55 (P1(f2(f2(f2(f1(x3361),f1(x3361)),x3362),x3362))),
% 234.57/234.55 inference(scs_inference,[],[67,217,8])).
% 234.57/234.55 cnf(361,plain,
% 234.57/234.55 (P1(f2(f2(f2(f1(x3611),f1(x3611)),f1(x3612)),x3612))),
% 234.57/234.55 inference(scs_inference,[],[135,336,8])).
% 234.57/234.55 cnf(365,plain,
% 234.57/234.55 (P1(f1(f2(f2(f2(f1(x3651),f1(x3651)),f1(x3652)),x3652)))),
% 234.57/234.55 inference(scs_inference,[],[361,7])).
% 234.57/234.55 cnf(381,plain,
% 234.57/234.55 (~P1(f2(f2(f2(f4(x3811),f4(x3812)),f2(x3812,x3811)),f2(f4(x3813),f4(x3814))))+P1(f1(f2(x3814,x3813)))),
% 234.57/234.55 inference(scs_inference,[],[254,8,7])).
% 234.57/234.55 cnf(474,plain,
% 234.57/234.55 (P1(f2(f4(x4741),f2(x4741,x4742)))),
% 234.57/234.55 inference(scs_inference,[],[2,248,8])).
% 234.57/234.55 cnf(487,plain,
% 234.57/234.55 (P1(f2(f1(x4871),f2(x4872,x4871)))),
% 234.57/234.55 inference(scs_inference,[],[19,135,8])).
% 234.57/234.55 cnf(645,plain,
% 234.57/234.55 (P1(f2(x6451,f2(f2(f2(f1(x6452),f1(x6452)),f1(x6453)),x6453)))),
% 234.57/234.55 inference(scs_inference,[],[365,487,8])).
% 234.57/234.55 cnf(992,plain,
% 234.57/234.55 (P1(f2(f2(x9921,f2(f2(f1(x9922),f1(x9922)),f1(x9923))),f2(x9921,x9923)))),
% 234.57/234.55 inference(scs_inference,[],[5,645,8])).
% 234.57/234.55 cnf(1128,plain,
% 234.57/234.55 (P1(f2(f4(f4(x11281)),f2(x11282,x11281)))),
% 234.57/234.55 inference(scs_inference,[],[474,248,8])).
% 234.57/234.55 cnf(1425,plain,
% 234.57/234.55 (P1(f2(f4(f4(f1(x14251))),x14251))),
% 234.57/234.55 inference(scs_inference,[],[1128,992,8])).
% 234.57/234.55 cnf(2026,plain,
% 234.57/234.55 (~P1(f2(f1(a3),f1(f4(f1(f4(a3))))))),
% 234.57/234.55 inference(scs_inference,[],[135,6,8])).
% 234.57/234.55 cnf(3799,plain,
% 234.57/234.55 (~P1(f2(f2(f2(f4(x37991),f4(x37992)),f2(x37992,x37991)),f2(f4(f4(f1(f4(a3)))),f4(a3))))),
% 234.57/234.55 inference(scs_inference,[],[4,2026,8,381])).
% 234.57/234.55 cnf(3991,plain,
% 234.57/234.55 ($false),
% 234.57/234.55 inference(scs_inference,[],[2,3799,1425,8]),
% 234.57/234.55 ['proof']).
% 234.57/234.56 % SZS output end Proof
% 234.57/234.56 % Total time :233.850000s
%------------------------------------------------------------------------------