TSTP Solution File: SWW951+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWW951+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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 : Thu Jul 21 01:17:58 EDT 2022
% Result : Theorem 0.76s 1.07s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW951+1 : TPTP v8.1.0. Released v7.4.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n027.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 : Sun Jun 5 16:24:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.46/1.02 ============================== Prover9 ===============================
% 0.46/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.02 Process 24420 was started by sandbox2 on n027.cluster.edu,
% 0.46/1.02 Sun Jun 5 16:24:39 2022
% 0.46/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24176_n027.cluster.edu".
% 0.46/1.02 ============================== end of head ===========================
% 0.46/1.02
% 0.46/1.02 ============================== INPUT =================================
% 0.46/1.02
% 0.46/1.02 % Reading from file /tmp/Prover9_24176_n027.cluster.edu
% 0.46/1.02
% 0.46/1.02 set(prolog_style_variables).
% 0.46/1.02 set(auto2).
% 0.46/1.02 % set(auto2) -> set(auto).
% 0.46/1.02 % set(auto) -> set(auto_inference).
% 0.46/1.02 % set(auto) -> set(auto_setup).
% 0.46/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.02 % set(auto) -> set(auto_limits).
% 0.46/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.02 % set(auto) -> set(auto_denials).
% 0.46/1.02 % set(auto) -> set(auto_process).
% 0.46/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.02 % set(auto2) -> assign(stats, some).
% 0.46/1.02 % set(auto2) -> clear(echo_input).
% 0.46/1.02 % set(auto2) -> set(quiet).
% 0.46/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.02 % set(auto2) -> clear(print_given).
% 0.46/1.02 assign(lrs_ticks,-1).
% 0.46/1.02 assign(sos_limit,10000).
% 0.46/1.02 assign(order,kbo).
% 0.46/1.02 set(lex_order_vars).
% 0.46/1.02 clear(print_given).
% 0.46/1.02
% 0.46/1.02 % formulas(sos). % not echoed (66 formulas)
% 0.46/1.02
% 0.46/1.02 ============================== end of input ==========================
% 0.46/1.02
% 0.46/1.02 % From the command line: assign(max_seconds, 300).
% 0.46/1.02
% 0.46/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.02
% 0.46/1.02 % Formulas that are not ordinary clauses:
% 0.46/1.02 1 (all VAR_X_10X30 constr_xor(VAR_X_10X30,VAR_X_10X30) = constr_ZERO) # label(ax36) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 2 (all VAR_X_9 constr_xor(VAR_X_9,constr_ZERO) = VAR_X_9) # label(ax37) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 3 (all VAR_X_7 all VAR_Y_8 constr_xor(VAR_X_7,VAR_Y_8) = constr_xor(VAR_Y_8,VAR_X_7)) # label(ax38) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 4 (all VAR_X_0X30 all VAR_Y_0X30 all VAR_Z_0X30 constr_xor(VAR_X_0X30,constr_xor(VAR_Y_0X30,VAR_Z_0X30)) = constr_xor(constr_xor(VAR_X_0X30,VAR_Y_0X30),VAR_Z_0X30)) # label(ax39) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 5 (all VAR_V_26 all VAR_V_27 (pred_attacker(VAR_V_26) & pred_attacker(VAR_V_27) -> pred_attacker(constr_xor(VAR_V_26,VAR_V_27)))) # label(ax40) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 6 (all VAR_V_30X30 (pred_attacker(VAR_V_30X30) -> pred_attacker(constr_h(VAR_V_30X30)))) # label(ax42) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 7 (all VAR_V_32 (pred_attacker(VAR_V_32) -> pred_attacker(tuple_T_out_4(VAR_V_32)))) # label(ax45) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 8 (all VAR_V_35 (pred_attacker(tuple_T_out_4(VAR_V_35)) -> pred_attacker(VAR_V_35))) # label(ax46) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 9 (all VAR_V_38 (pred_attacker(VAR_V_38) -> pred_attacker(tuple_T_out_2(VAR_V_38)))) # label(ax47) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 10 (all VAR_V_41 (pred_attacker(tuple_T_out_2(VAR_V_41)) -> pred_attacker(VAR_V_41))) # label(ax48) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 11 (all VAR_V_44 (pred_attacker(VAR_V_44) -> pred_attacker(tuple_T_in_3(VAR_V_44)))) # label(ax49) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 12 (all VAR_V_47 (pred_attacker(tuple_T_in_3(VAR_V_47)) -> pred_attacker(VAR_V_47))) # label(ax50) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 13 (all VAR_V_50X30 (pred_attacker(VAR_V_50X30) -> pred_attacker(tuple_
% 0.46/1.02 WARNING: denials share constants (see output).
% 0.46/1.02
% 0.46/1.02 T_in_1(VAR_V_50X30)))) # label(ax51) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 14 (all VAR_V_53 (pred_attacker(tuple_T_in_1(VAR_V_53)) -> pred_attacker(VAR_V_53))) # label(ax52) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 15 (all VAR_V_59 all VAR_V_60X30 (pred_mess(VAR_V_60X30,VAR_V_59) & pred_attacker(VAR_V_60X30) -> pred_attacker(VAR_V_59))) # label(ax58) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 16 (all VAR_V_61 all VAR_V_62 (pred_attacker(VAR_V_62) & pred_attacker(VAR_V_61) -> pred_mess(VAR_V_62,VAR_V_61))) # label(ax59) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 17 (all VAR_V_64 pred_equal(VAR_V_64,VAR_V_64)) # label(ax61) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 18 (all VAR_V_65 pred_attacker(name_new0x2Dname(VAR_V_65))) # label(ax62) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 19 (all VAR_R1_85 (pred_attacker(tuple_T_in_1(VAR_R1_85)) -> pred_attacker(tuple_T_out_2(constr_h(constr_xor(name_k,VAR_R1_85)))))) # label(ax63) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02 20 (all VAR_K_XOR_K1_10X305 all VAR_R1_10X306 (pred_attacker(tuple_T_in_3(VAR_K_XOR_K1_10X305)) & pred_attacker(tuple_T_in_1(VAR_R1_10X306)) -> pred_attacker(tuple_T_out_4(name_objective)))) # label(ax64) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.02
% 0.46/1.02 ============================== end of process non-clausal formulas ===
% 0.46/1.02
% 0.46/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.02
% 0.46/1.02 ============================== PREDICATE ELIMINATION =================
% 0.46/1.02 21 -pred_attacker(A) | -pred_attacker(B) | pred_mess(A,B) # label(ax59) # label(axiom). [clausify(16)].
% 0.46/1.02 22 -pred_mess(A,B) | -pred_attacker(A) | pred_attacker(B) # label(ax58) # label(axiom). [clausify(15)].
% 0.46/1.02
% 0.46/1.02 ============================== end predicate elimination =============
% 0.46/1.02
% 0.46/1.02 Auto_denials:
% 0.46/1.02 % copying label co0 to answer in negative clause
% 0.46/1.02 % copying label ax0 to answer in negative clause
% 0.46/1.02 % copying label ax1 to answer in negative clause
% 0.46/1.02 % copying label ax2 to answer in negative clause
% 0.46/1.02 % copying label ax3 to answer in negative clause
% 0.46/1.02 % copying label ax4 to answer in negative clause
% 0.46/1.02 % copying label ax5 to answer in negative clause
% 0.46/1.02 % copying label ax6 to answer in negative clause
% 0.46/1.02 % copying label ax7 to answer in negative clause
% 0.46/1.02 % copying label ax8 to answer in negative clause
% 0.46/1.02 % copying label ax9 to answer in negative clause
% 0.46/1.02 % copying label ax10 to answer in negative clause
% 0.46/1.02 % copying label ax11 to answer in negative clause
% 0.46/1.02 % copying label ax12 to answer in negative clause
% 0.46/1.02 % copying label ax13 to answer in negative clause
% 0.46/1.02 % copying label ax14 to answer in negative clause
% 0.46/1.02 % copying label ax15 to answer in negative clause
% 0.46/1.02 % copying label ax16 to answer in negative clause
% 0.46/1.02 % copying label ax17 to answer in negative clause
% 0.46/1.02 % copying label ax18 to answer in negative clause
% 0.46/1.02 % copying label ax19 to answer in negative clause
% 0.46/1.02 % copying label ax20 to answer in negative clause
% 0.46/1.02 % copying label ax21 to answer in negative clause
% 0.46/1.02 % copying label ax22 to answer in negative clause
% 0.46/1.02 % copying label ax23 to answer in negative clause
% 0.46/1.02 % copying label ax24 to answer in negative clause
% 0.46/1.02 % copying label ax25 to answer in negative clause
% 0.46/1.02 % copying label ax26 to answer in negative clause
% 0.46/1.02 % copying label ax27 to answer in negative clause
% 0.46/1.02 % copying label ax28 to answer in negative clause
% 0.46/1.02 % copying label ax29 to answer in negative clause
% 0.46/1.02 % copying label ax30 to answer in negative clause
% 0.46/1.02 % copying label ax31 to answer in negative clause
% 0.46/1.02 % copying label ax32 to answer in negative clause
% 0.46/1.02 % copying label ax33 to answer in negative clause
% 0.46/1.02 % copying label ax34 to answer in negative clause
% 0.46/1.02 % copying label ax35 to answer in negative clause
% 0.46/1.02 % assign(max_proofs, 37). % (Horn set with more than one neg. clause)
% 0.46/1.02
% 0.46/1.02 WARNING, because some of the denials share constants,
% 0.46/1.02 some of the denials or their descendents may be subsumed,
% 0.46/1.02 preventing the target number of proofs from being found.
% 0.46/1.02 The shared constants are: name_k, name_c, constr_ZERO, constr_CONST_4, constr_CONST_3, constr_CONST_2, constr_CONST_1, constr_CONST_0x30, name_objective.
% 0.76/1.07
% 0.76/1.07 Term ordering decisions:
% 0.76/1.07 Function symbol KB weights: constr_ZERO=1. constr_CONST_0x30=1. constr_CONST_1=1. constr_CONST_2=1. constr_CONST_3=1. constr_CONST_4=1. name_c=1. name_k=1. name_objective=1. tuple_false=1. tuple_true=1. constr_xor=1. tuple_T_in_1=1. tuple_T_in_3=1. tuple_T_out_2=1. tuple_T_out_4=1. constr_h=1. name_new0x2Dname=1.
% 0.76/1.07
% 0.76/1.07 ============================== end of process initial clauses ========
% 0.76/1.07
% 0.76/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.07
% 0.76/1.07 ============================== end of clauses for search =============
% 0.76/1.07
% 0.76/1.07 ============================== SEARCH ================================
% 0.76/1.07
% 0.76/1.07 % Starting search at 0.01 seconds.
% 0.76/1.07
% 0.76/1.07 ============================== PROOF =================================
% 0.76/1.07 % SZS status Theorem
% 0.76/1.07 % SZS output start Refutation
% 0.76/1.07
% 0.76/1.07 % Proof 1 at 0.06 (+ 0.01) seconds: co0.
% 0.76/1.07 % Length of proof is 15.
% 0.76/1.07 % Level of proof is 4.
% 0.76/1.07 % Maximum clause weight is 9.000.
% 0.76/1.07 % Given clauses 123.
% 0.76/1.07
% 0.76/1.07 8 (all VAR_V_35 (pred_attacker(tuple_T_out_4(VAR_V_35)) -> pred_attacker(VAR_V_35))) # label(ax46) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.07 11 (all VAR_V_44 (pred_attacker(VAR_V_44) -> pred_attacker(tuple_T_in_3(VAR_V_44)))) # label(ax49) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.07 13 (all VAR_V_50X30 (pred_attacker(VAR_V_50X30) -> pred_attacker(tuple_T_in_1(VAR_V_50X30)))) # label(ax51) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.07 20 (all VAR_K_XOR_K1_10X305 all VAR_R1_10X306 (pred_attacker(tuple_T_in_3(VAR_K_XOR_K1_10X305)) & pred_attacker(tuple_T_in_1(VAR_R1_10X306)) -> pred_attacker(tuple_T_out_4(name_objective)))) # label(ax64) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.07 31 pred_attacker(name_c) # label(ax60) # label(axiom). [assumption].
% 0.76/1.07 38 -pred_attacker(name_objective) # label(co0) # label(negated_conjecture) # answer(co0). [assumption].
% 0.76/1.07 108 -pred_attacker(tuple_T_out_4(A)) | pred_attacker(A) # label(ax46) # label(axiom). [clausify(8)].
% 0.76/1.07 111 -pred_attacker(A) | pred_attacker(tuple_T_in_3(A)) # label(ax49) # label(axiom). [clausify(11)].
% 0.76/1.07 113 -pred_attacker(A) | pred_attacker(tuple_T_in_1(A)) # label(ax51) # label(axiom). [clausify(13)].
% 0.76/1.07 118 -pred_attacker(tuple_T_in_3(A)) | -pred_attacker(tuple_T_in_1(B)) | pred_attacker(tuple_T_out_4(name_objective)) # label(ax64) # label(axiom). [clausify(20)].
% 0.76/1.07 140 -pred_attacker(tuple_T_out_4(name_objective)) # answer(co0). [ur(108,b,38,a)].
% 0.76/1.07 153 pred_attacker(tuple_T_in_3(name_c)). [hyper(111,a,31,a)].
% 0.76/1.07 1294 pred_attacker(tuple_T_in_1(tuple_T_in_3(name_c))). [hyper(113,a,153,a)].
% 0.76/1.07 1299 -pred_attacker(tuple_T_in_1(A)) # answer(co0). [ur(118,a,153,a,c,140,a)].
% 0.76/1.07 1300 $F # answer(co0). [resolve(1299,a,1294,a)].
% 0.76/1.07
% 0.76/1.07 % SZS output end Refutation
% 0.76/1.07 ============================== end of proof ==========================
% 0.76/1.07 % Redundant proof: 1301 $F # answer(co0). [resolve(1299,a,1232,a)].
% 0.76/1.07 % Redundant proof: 1302 $F # answer(co0). [resolve(1299,a,1187,a)].
% 0.76/1.07 % Redundant proof: 1303 $F # answer(co0). [resolve(1299,a,1143,a)].
% 0.76/1.07 % Redundant proof: 1304 $F # answer(co0). [resolve(1299,a,1100,a)].
% 0.76/1.07 % Redundant proof: 1305 $F # answer(co0). [resolve(1299,a,1058,a)].
% 0.76/1.07 % Redundant proof: 1306 $F # answer(co0). [resolve(1299,a,1001,a)].
% 0.76/1.07 % Redundant proof: 1307 $F # answer(co0). [resolve(1299,a,958,a)].
% 0.76/1.07 % Redundant proof: 1308 $F # answer(co0). [resolve(1299,a,919,a)].
% 0.76/1.07 % Redundant proof: 1309 $F # answer(co0). [resolve(1299,a,881,a)].
% 0.76/1.07 % Redundant proof: 1310 $F # answer(co0). [resolve(1299,a,844,a)].
% 0.76/1.07 % Redundant proof: 1311 $F # answer(co0). [resolve(1299,a,792,a)].
% 0.76/1.07 % Redundant proof: 1312 $F # answer(co0). [resolve(1299,a,757,a)].
% 0.76/1.07 % Redundant proof: 1313 $F # answer(co0). [resolve(1299,a,723,a)].
% 0.76/1.07 % Redundant proof: 1314 $F # answer(co0). [resolve(1299,a,690,a)].
% 0.76/1.07 % Redundant proof: 1315 $F # answer(co0). [resolve(1299,a,658,a)].
% 0.76/1.07 % Redundant proof: 1316 $F # answer(co0). [resolve(1299,a,611,a)].
% 0.76/1.07 % Redundant proof: 1317 $F # answer(co0). [resolve(1299,a,579,a)].
% 0.76/1.07 % Redundant proof: 1318 $F # answer(co0). [resolve(1299,a,550,a)].
% 0.76/1.07 % Redundant proof: 1319 $F # answer(co0). [resolve(1299,a,522,a)].
% 0.76/1.07 % Redundant proof: 13Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------