TSTP Solution File: LCL114-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL114-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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 : 600s
% DateTime : Sun Jul 17 13:44:09 EDT 2022
% Result : Unsatisfiable 0.75s 1.04s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL114-2 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n015.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 2 17:47:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.03 ============================== Prover9 ===============================
% 0.44/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.03 Process 1755 was started by sandbox on n015.cluster.edu,
% 0.44/1.03 Sat Jul 2 17:47:45 2022
% 0.44/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1416_n015.cluster.edu".
% 0.44/1.03 ============================== end of head ===========================
% 0.44/1.03
% 0.44/1.03 ============================== INPUT =================================
% 0.44/1.03
% 0.44/1.03 % Reading from file /tmp/Prover9_1416_n015.cluster.edu
% 0.44/1.03
% 0.44/1.03 set(prolog_style_variables).
% 0.44/1.03 set(auto2).
% 0.44/1.03 % set(auto2) -> set(auto).
% 0.44/1.03 % set(auto) -> set(auto_inference).
% 0.44/1.03 % set(auto) -> set(auto_setup).
% 0.44/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.03 % set(auto) -> set(auto_limits).
% 0.44/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.03 % set(auto) -> set(auto_denials).
% 0.44/1.03 % set(auto) -> set(auto_process).
% 0.44/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.03 % set(auto2) -> assign(stats, some).
% 0.75/1.03 % set(auto2) -> clear(echo_input).
% 0.75/1.03 % set(auto2) -> set(quiet).
% 0.75/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.03 % set(auto2) -> clear(print_given).
% 0.75/1.03 assign(lrs_ticks,-1).
% 0.75/1.03 assign(sos_limit,10000).
% 0.75/1.03 assign(order,kbo).
% 0.75/1.03 set(lex_order_vars).
% 0.75/1.03 clear(print_given).
% 0.75/1.03
% 0.75/1.03 % formulas(sos). % not echoed (5 formulas)
% 0.75/1.03
% 0.75/1.03 ============================== end of input ==========================
% 0.75/1.03
% 0.75/1.03 % From the command line: assign(max_seconds, 300).
% 0.75/1.03
% 0.75/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.04
% 0.75/1.04 % Formulas that are not ordinary clauses:
% 0.75/1.04
% 0.75/1.04 ============================== end of process non-clausal formulas ===
% 0.75/1.04
% 0.75/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.04
% 0.75/1.04 ============================== PREDICATE ELIMINATION =================
% 0.75/1.04
% 0.75/1.04 ============================== end predicate elimination =============
% 0.75/1.04
% 0.75/1.04 Auto_denials:
% 0.75/1.04 % copying label prove_mv_36 to answer in negative clause
% 0.75/1.04
% 0.75/1.04 Term ordering decisions:
% 0.75/1.04
% 0.75/1.04 % Assigning unary symbol not kb_weight 0 and highest precedence (6).
% 0.75/1.04 Function symbol KB weights: truth=1. x=1. y=1. implies=1. not=0.
% 0.75/1.04
% 0.75/1.04 ============================== end of process initial clauses ========
% 0.75/1.04
% 0.75/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.04
% 0.75/1.04 ============================== end of clauses for search =============
% 0.75/1.04
% 0.75/1.04 ============================== SEARCH ================================
% 0.75/1.04
% 0.75/1.04 % Starting search at 0.01 seconds.
% 0.75/1.04
% 0.75/1.04 ============================== PROOF =================================
% 0.75/1.04 % SZS status Unsatisfiable
% 0.75/1.04 % SZS output start Refutation
% 0.75/1.04
% 0.75/1.04 % Proof 1 at 0.03 (+ 0.00) seconds: prove_mv_36.
% 0.75/1.04 % Length of proof is 28.
% 0.75/1.04 % Level of proof is 14.
% 0.75/1.04 % Maximum clause weight is 23.000.
% 0.75/1.04 % Given clauses 28.
% 0.75/1.04
% 0.75/1.04 1 implies(truth,A) = A # label(wajsberg_1) # label(axiom). [assumption].
% 0.75/1.04 2 implies(implies(A,B),B) = implies(implies(B,A),A) # label(wajsberg_3) # label(axiom). [assumption].
% 0.75/1.04 3 implies(implies(not(A),not(B)),implies(B,A)) = truth # label(wajsberg_4) # label(axiom). [assumption].
% 0.75/1.04 4 implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth # label(wajsberg_2) # label(axiom). [assumption].
% 0.75/1.04 5 implies(implies(x,y),implies(not(y),not(x))) != truth # label(prove_mv_36) # label(negated_conjecture) # answer(prove_mv_36). [assumption].
% 0.75/1.04 6 implies(implies(A,truth),truth) = implies(A,A). [para(1(a,1),2(a,1,1)),flip(a)].
% 0.75/1.04 7 implies(implies(implies(A,B),B),B) = implies(implies(implies(B,A),A),B). [para(2(a,1),2(a,1,1)),rewrite([2(7)]),flip(a)].
% 0.75/1.04 8 implies(implies(not(A),not(truth)),A) = truth. [para(1(a,1),3(a,1,2))].
% 0.75/1.04 10 implies(implies(not(A),not(implies(B,A))),implies(implies(A,B),B)) = truth. [para(2(a,1),3(a,1,2))].
% 0.75/1.04 12 implies(A,implies(implies(A,B),B)) = truth. [para(1(a,1),4(a,1,1)),rewrite([1(3)])].
% 0.75/1.04 13 implies(implies(A,truth),implies(B,implies(A,B))) = truth. [para(1(a,1),4(a,1,2,1))].
% 0.75/1.04 14 implies(implies(implies(implies(A,B),implies(C,B)),implies(C,A)),implies(C,A)) = implies(implies(A,B),implies(C,B)). [para(4(a,1),2(a,1,1)),rewrite([1(5)]),flip(a)].
% 0.75/1.04 46 implies(A,A) = truth. [para(12(a,1),1(a,1)),rewrite([1(3)]),flip(a)].
% 0.75/1.04 55 implies(A,truth) = truth. [para(6(a,1),12(a,1,2)),rewrite([46(1)])].
% 0.75/1.04 56 implies(A,implies(B,A)) = truth. [back_rewrite(13),rewrite([55(2),1(4)])].
% 0.75/1.04 57 implies(implies(implies(A,B),B),A) = implies(B,A). [para(7(a,1),2(a,1)),rewrite([56(5),1(6)])].
% 0.75/1.04 74 implies(implies(implies(A,B),C),implies(B,C)) = truth. [para(56(a,1),4(a,1,1)),rewrite([1(6)])].
% 0.75/1.04 76 implies(not(truth),not(not(truth))) = not(not(truth)). [para(8(a,1),57(a,1,1)),rewrite([1(5)]),flip(a)].
% 0.75/1.04 95 implies(not(truth),A) = truth. [para(8(a,1),74(a,1,1)),rewrite([1(5)])].
% 0.75/1.04 104 not(not(truth)) = truth. [back_rewrite(76),rewrite([95(6)]),flip(a)].
% 0.75/1.04 115 implies(not(implies(A,not(truth))),A) = truth. [para(104(a,1),10(a,1,1,1)),rewrite([1(6),95(7),1(6)])].
% 0.75/1.04 135 implies(A,implies(not(A),not(truth))) = truth. [para(115(a,1),3(a,1,1)),rewrite([1(7)])].
% 0.75/1.04 172 implies(not(A),not(truth)) = A. [para(135(a,1),2(a,1,1)),rewrite([1(6),8(9),1(6)])].
% 0.75/1.04 173 implies(A,not(truth)) = not(A). [para(172(a,1),2(a,1,1)),rewrite([95(7),1(6)])].
% 0.75/1.04 176 implies(implies(A,not(B)),implies(B,not(A))) = truth. [para(172(a,1),4(a,1,2,1)),rewrite([173(5)])].
% 0.75/1.04 178 not(not(A)) = A. [para(172(a,1),57(a,2)),rewrite([95(4),1(3),173(4)])].
% 0.75/1.04 180 implies(A,not(B)) = implies(B,not(A)). [para(172(a,1),14(a,1,1,1,1)),rewrite([173(3),176(5),1(4),173(6),178(4),173(5)])].
% 0.75/1.04 184 $F # answer(prove_mv_36). [back_rewrite(5),rewrite([180(8),178(7),46(7)]),xx(a)].
% 0.75/1.04
% 0.75/1.04 % SZS output end Refutation
% 0.75/1.04 ============================== end of proof ==========================
% 0.75/1.04
% 0.75/1.04 ============================== STATISTICS ============================
% 0.75/1.04
% 0.75/1.04 Given=28. Generated=1042. Kept=183. proofs=1.
% 0.75/1.04 Usable=16. Sos=70. Demods=88. Limbo=4, Disabled=98. Hints=0.
% 0.75/1.04 Megabytes=0.21.
% 0.75/1.04 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.75/1.04
% 0.75/1.04 ============================== end of statistics =====================
% 0.75/1.04
% 0.75/1.04 ============================== end of search =========================
% 0.75/1.04
% 0.75/1.04 THEOREM PROVED
% 0.75/1.04 % SZS status Unsatisfiable
% 0.75/1.04
% 0.75/1.04 Exiting with 1 proof.
% 0.75/1.04
% 0.75/1.04 Process 1755 exit (max_proofs) Sat Jul 2 17:47:45 2022
% 0.75/1.04 Prover9 interrupted
%------------------------------------------------------------------------------