TSTP Solution File: SWV283-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV283-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n007.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 : Wed Jul 20 18:20:06 EDT 2022
% Result : Unsatisfiable 0.19s 0.37s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV283-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n007.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 : Wed Jun 15 06:06:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 6 Number of unprocessed: 6
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 6 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 3 conjectures.
% 0.19/0.37 # There are 3 start rule candidates:
% 0.19/0.37 # Found 0 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 3 start rule tableaux created.
% 0.19/0.37 # 6 extension rule candidate clauses
% 0.19/0.37 # 0 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.19/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37 # We now have 9 tableaux to operate on
% 0.19/0.37 # Closed tableau found in foldup close cycle with 7 folds and 1 closures done.
% 0.19/0.37 # There were 0 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 0 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 0 successful branch saturations after the branch.
% 0.19/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_10, negated_conjecture, (~c_lessequals(v_x,X1,tc_nat)|~c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_list),tc_Message_Omsg))).
% 0.19/0.37 cnf(i_0_7, plain, (~c_lessequals(v_sko__upX(X1),X2,tc_nat)|~c_in(c_Message_Omsg_ONonce(X2),c_Message_Oparts(c_insert(X1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg))).
% 0.19/0.37 cnf(i_0_8, plain, (c_lessequals(X1,X2,tc_nat)|~c_lessequals(c_plus(X3,X1,tc_nat),X2,tc_nat))).
% 0.19/0.37 cnf(i_0_9, plain, (c_lessequals(X1,X2,tc_nat)|~c_lessequals(c_plus(X1,X3,tc_nat),X2,tc_nat))).
% 0.19/0.37 cnf(i_0_11, negated_conjecture, (c_lessequals(X1,v_xd(X1),tc_nat)|c_lessequals(X2,v_xd(X2),tc_nat))).
% 0.19/0.37 cnf(i_0_12, negated_conjecture, (c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(v_xd(X2)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Event_Oused(v_list),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(v_xd(X2)),c_Event_Oused(v_list),tc_Message_Omsg))).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 19 steps
% 0.19/0.37 cnf(i_0_10, negated_conjecture, (~c_lessequals(v_x,v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)|~c_in(c_Message_Omsg_ONonce(v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat))),c_Event_Oused(v_list),tc_Message_Omsg)), inference(start_rule)).
% 0.19/0.37 cnf(i_0_19, plain, (~c_lessequals(v_x,v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)), inference(extension_rule, [i_0_8])).
% 0.19/0.37 cnf(i_0_94, plain, (~c_lessequals(c_plus(X7,v_x,tc_nat),v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)), inference(extension_rule, [i_0_9])).
% 0.19/0.37 cnf(i_0_98, plain, (~c_lessequals(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat),v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)), inference(extension_rule, [i_0_11])).
% 0.19/0.37 cnf(i_0_106, plain, (c_lessequals(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat),v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)), inference(closure_rule, [i_0_98])).
% 0.19/0.37 cnf(i_0_20, plain, (~c_in(c_Message_Omsg_ONonce(v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat))),c_Event_Oused(v_list),tc_Message_Omsg)), inference(extension_rule, [i_0_12])).
% 0.19/0.37 cnf(i_0_112, plain, (c_in(c_Message_Omsg_ONonce(v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat))),c_Event_Oused(v_list),tc_Message_Omsg)), inference(closure_rule, [i_0_20])).
% 0.19/0.37 cnf(i_0_109, plain, (c_in(c_Message_Omsg_ONonce(v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat))),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)), inference(extension_rule, [i_0_7])).
% 0.19/0.37 cnf(i_0_113, plain, (~c_lessequals(v_sko__upX(v_xc),v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)), inference(extension_rule, [i_0_8])).
% 0.19/0.37 cnf(i_0_110, plain, (c_in(c_Message_Omsg_ONonce(v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat))),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)), inference(extension_rule, [i_0_7])).
% 0.19/0.37 cnf(i_0_129, plain, (~c_lessequals(v_sko__upX(v_xc),v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)), inference(extension_rule, [i_0_9])).
% 0.19/0.37 cnf(i_0_118, plain, (~c_lessequals(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)), inference(extension_rule, [i_0_9])).
% 0.19/0.37 cnf(i_0_974, plain, (~c_lessequals(c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)), inference(extension_rule, [i_0_8])).
% 0.19/0.37 cnf(i_0_984, plain, (~c_lessequals(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat),v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)), inference(extension_rule, [i_0_11])).
% 0.19/0.37 cnf(i_0_994, plain, (c_lessequals(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat),v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)), inference(closure_rule, [i_0_984])).
% 0.19/0.37 cnf(i_0_134, plain, (~c_lessequals(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)), inference(extension_rule, [i_0_9])).
% 0.19/0.37 cnf(i_0_1004, plain, (~c_lessequals(c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)), inference(extension_rule, [i_0_8])).
% 0.19/0.37 cnf(i_0_1014, plain, (~c_lessequals(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat),v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)), inference(extension_rule, [i_0_11])).
% 0.19/0.37 cnf(i_0_1024, plain, (c_lessequals(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat),v_xd(c_plus(c_plus(X7,v_x,tc_nat),c_plus(c_plus(v_sko__upX(v_xc),v_sko__upX(v_xc),tc_nat),X6,tc_nat),tc_nat)),tc_nat)), inference(closure_rule, [i_0_1014])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # Child (881) has found a proof.
% 0.19/0.37
% 0.19/0.37 # Proof search is over...
% 0.19/0.37 # Freeing feature tree
%------------------------------------------------------------------------------