TSTP Solution File: LCL112-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL112-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 : n002.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:48:01 EDT 2023
% Result : Unsatisfiable 62.04s 62.16s
% Output : CNFRefutation 62.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LCL112-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 24 18:08:32 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.59 start to proof:theBenchmark
% 62.04/62.14 %-------------------------------------------
% 62.04/62.14 % File :CSE---1.6
% 62.04/62.14 % Problem :theBenchmark
% 62.04/62.14 % Transform :cnf
% 62.04/62.14 % Format :tptp:raw
% 62.04/62.14 % Command :java -jar mcs_scs.jar %d %s
% 62.04/62.14
% 62.04/62.14 % Result :Theorem 61.430000s
% 62.04/62.14 % Output :CNFRefutation 61.430000s
% 62.04/62.14 %-------------------------------------------
% 62.04/62.16 %--------------------------------------------------------------------------
% 62.04/62.16 % File : LCL112-1 : TPTP v8.1.2. Released v1.0.0.
% 62.04/62.16 % Domain : Logic Calculi (Many valued sentential)
% 62.04/62.16 % Problem : MV-29 depnds on the Merideth system
% 62.04/62.16 % Version : [McC92] axioms.
% 62.04/62.16 % English : An axiomatisation of the many valued sentential calculus
% 62.04/62.16 % is {MV-1,MV-2,MV-3,MV-5} by Meredith. Show that 29 depends
% 62.04/62.16 % on the Meredith system.
% 62.04/62.16
% 62.04/62.16 % Refs : [MW92] McCune & Wos (1992), Experiments in Automated Deductio
% 62.04/62.16 % : [McC92] McCune (1992), Email to G. Sutcliffe
% 62.04/62.16 % Source : [McC92]
% 62.04/62.16 % Names : MV-58 [MW92]
% 62.04/62.16 % : mv.in part 3 [OTTER]
% 62.04/62.16
% 62.04/62.16 % Status : Unsatisfiable
% 62.04/62.16 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.15 v5.2.0, 0.08 v5.1.0, 0.06 v5.0.0, 0.07 v4.0.1, 0.00 v2.6.0, 0.14 v2.5.0, 0.00 v2.4.0, 0.00 v2.3.0, 0.14 v2.2.1, 0.11 v2.1.0, 0.13 v2.0.0
% 62.04/62.16 % Syntax : Number of clauses : 6 ( 5 unt; 0 nHn; 2 RR)
% 62.04/62.16 % Number of literals : 8 ( 0 equ; 3 neg)
% 62.04/62.16 % Maximal clause size : 3 ( 1 avg)
% 62.04/62.16 % Maximal term depth : 4 ( 2 avg)
% 62.04/62.16 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty)
% 62.04/62.16 % Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% 62.04/62.16 % Number of variables : 11 ( 1 sgn)
% 62.04/62.16 % SPC : CNF_UNS_RFO_NEQ_HRN
% 62.04/62.16
% 62.04/62.16 % Comments :
% 62.04/62.16 %--------------------------------------------------------------------------
% 62.04/62.16 cnf(condensed_detachment,axiom,
% 62.04/62.16 ( ~ is_a_theorem(implies(X,Y))
% 62.04/62.16 | ~ is_a_theorem(X)
% 62.04/62.16 | is_a_theorem(Y) ) ).
% 62.04/62.16
% 62.04/62.16 cnf(mv_1,axiom,
% 62.04/62.16 is_a_theorem(implies(X,implies(Y,X))) ).
% 62.04/62.16
% 62.04/62.16 cnf(mv_2,axiom,
% 62.04/62.16 is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))) ).
% 62.04/62.16
% 62.04/62.16 cnf(mv_3,axiom,
% 62.04/62.16 is_a_theorem(implies(implies(implies(X,Y),Y),implies(implies(Y,X),X))) ).
% 62.04/62.16
% 62.04/62.16 cnf(mv_5,axiom,
% 62.04/62.16 is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))) ).
% 62.04/62.16
% 62.04/62.16 cnf(prove_mv_29,negated_conjecture,
% 62.04/62.16 ~ is_a_theorem(implies(a,not(not(a)))) ).
% 62.04/62.16
% 62.04/62.16 %--------------------------------------------------------------------------
% 62.04/62.16 %-------------------------------------------
% 62.04/62.16 % Proof found
% 62.04/62.16 % SZS status Theorem for theBenchmark
% 62.04/62.16 % SZS output start Proof
% 62.07/62.17 %ClaNum:6(EqnAxiom:0)
% 62.07/62.17 %VarNum:23(SingletonVarNum:11)
% 62.07/62.17 %MaxLitNum:3
% 62.07/62.17 %MaxfuncDepth:3
% 62.07/62.17 %SharedTerms:5
% 62.07/62.17 %goalClause: 5
% 62.07/62.17 %singleGoalClaCount:1
% 62.07/62.17 [5]~P1(f1(a2,f3(f3(a2))))
% 62.07/62.17 [1]P1(f1(x11,f1(x12,x11)))
% 62.07/62.17 [2]P1(f1(f1(f3(x21),f3(x22)),f1(x22,x21)))
% 62.07/62.17 [4]P1(f1(f1(f1(x41,x42),x42),f1(f1(x42,x41),x41)))
% 62.07/62.17 [3]P1(f1(f1(x31,x32),f1(f1(x32,x33),f1(x31,x33))))
% 62.07/62.17 [6]P1(x61)+~P1(x62)+~P1(f1(x62,x61))
% 62.07/62.17 %EqnAxiom
% 62.07/62.17
% 62.07/62.17 %-------------------------------------------
% 62.07/62.19 cnf(10,plain,
% 62.07/62.19 (P1(f1(f1(f1(x101,x102),x103),f1(x102,x103)))),
% 62.07/62.19 inference(scs_inference,[],[1,3,6])).
% 62.07/62.19 cnf(16,plain,
% 62.07/62.19 (P1(f1(x161,f1(f1(x161,x162),f1(x163,x162))))),
% 62.07/62.19 inference(scs_inference,[],[3,10,6])).
% 62.07/62.19 cnf(20,plain,
% 62.07/62.19 (P1(f1(f1(f1(f1(f3(x201),f3(x202)),f1(x202,x201)),x203),f1(x204,x203)))),
% 62.07/62.19 inference(scs_inference,[],[2,16,6])).
% 62.07/62.19 cnf(23,plain,
% 62.07/62.19 (P1(f1(f1(f1(f1(x231,x232),f1(x233,x232)),x234),f1(x231,x234)))),
% 62.07/62.19 inference(scs_inference,[],[3,16,6])).
% 62.07/62.19 cnf(30,plain,
% 62.07/62.19 (P1(f1(x301,f1(f1(x301,x302),x302)))),
% 62.07/62.19 inference(scs_inference,[],[4,10,6])).
% 62.07/62.19 cnf(37,plain,
% 62.07/62.19 (P1(f1(f1(f1(f1(f1(x371,x372),x373),f1(x372,x373)),x374),f1(x375,x374)))),
% 62.07/62.19 inference(scs_inference,[],[16,10,6])).
% 62.07/62.19 cnf(42,plain,
% 62.07/62.19 (P1(f1(x421,f1(f3(x422),f1(x422,x423))))),
% 62.07/62.19 inference(scs_inference,[],[10,20,6])).
% 62.07/62.19 cnf(46,plain,
% 62.07/62.19 (P1(f1(f3(x461),f1(x461,x462)))),
% 62.07/62.19 inference(scs_inference,[],[23,42,6])).
% 62.07/62.19 cnf(64,plain,
% 62.07/62.19 (P1(f1(f1(f1(f1(x641,x642),x642),x643),f1(x641,x643)))),
% 62.07/62.19 inference(scs_inference,[],[3,30,6])).
% 62.07/62.19 cnf(71,plain,
% 62.07/62.19 (P1(f1(x711,f1(f1(f1(x712,x713),x714),f1(x713,x714))))),
% 62.07/62.19 inference(scs_inference,[],[1,10,6])).
% 62.07/62.19 cnf(86,plain,
% 62.07/62.19 (P1(f1(x861,f1(x862,f1(x863,x863))))),
% 62.07/62.19 inference(scs_inference,[],[37,64,6])).
% 62.07/62.19 cnf(98,plain,
% 62.07/62.19 (P1(f1(x981,f1(x982,x982)))),
% 62.07/62.19 inference(scs_inference,[],[71,86,6])).
% 62.07/62.19 cnf(114,plain,
% 62.07/62.19 (P1(f1(f1(f1(x1141,x1141),x1142),x1142))),
% 62.07/62.19 inference(scs_inference,[],[98,4,6])).
% 62.07/62.19 cnf(134,plain,
% 62.07/62.19 (~P1(f1(f3(f3(f3(a2))),f3(a2)))),
% 62.07/62.19 inference(scs_inference,[],[5,2,6])).
% 62.07/62.19 cnf(174,plain,
% 62.07/62.19 (P1(f1(f1(f1(x1741,x1742),x1743),f1(f3(x1741),x1743)))),
% 62.07/62.19 inference(scs_inference,[],[46,3,6])).
% 62.07/62.19 cnf(294,plain,
% 62.07/62.19 (P1(f1(f3(f3(x2941)),f1(x2942,x2941)))),
% 62.07/62.19 inference(scs_inference,[],[2,174,6])).
% 62.07/62.19 cnf(917,plain,
% 62.07/62.19 (P1(f1(f1(f1(x9171,x9172),x9173),f1(f3(f3(x9172)),x9173)))),
% 62.07/62.19 inference(scs_inference,[],[3,294,6])).
% 62.07/62.19 cnf(920,plain,
% 62.07/62.19 ($false),
% 62.07/62.19 inference(scs_inference,[],[114,917,134,6]),
% 62.07/62.19 ['proof']).
% 62.07/62.19 % SZS output end Proof
% 62.07/62.19 % Total time :61.430000s
%------------------------------------------------------------------------------