TSTP Solution File: SWV275-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV275-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 : n023.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:02 EDT 2022
% Result : Unsatisfiable 0.21s 0.42s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV275-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/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 : n023.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 00:56:20 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 9 Number of unprocessed: 9
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.21/0.42 # The folding up rule is enabled...
% 0.21/0.42 # Local unification is enabled...
% 0.21/0.42 # Any saturation attempts will use folding labels...
% 0.21/0.42 # 9 beginning clauses after preprocessing and clausification
% 0.21/0.42 # Creating start rules for all 1 conjectures.
% 0.21/0.42 # There are 1 start rule candidates:
% 0.21/0.42 # Found 2 unit axioms.
% 0.21/0.42 # 1 start rule tableaux created.
% 0.21/0.42 # 7 extension rule candidate clauses
% 0.21/0.42 # 2 unit axiom clauses
% 0.21/0.42
% 0.21/0.42 # Requested 8, 32 cores available to the main process.
% 0.21/0.42 # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.42 # There were 1 total branch saturation attempts.
% 0.21/0.42 # There were 0 of these attempts blocked.
% 0.21/0.42 # There were 0 deferred branch saturation attempts.
% 0.21/0.42 # There were 0 free duplicated saturations.
% 0.21/0.42 # There were 1 total successful branch saturations.
% 0.21/0.42 # There were 0 successful branch saturations in interreduction.
% 0.21/0.42 # There were 0 successful branch saturations on the branch.
% 0.21/0.42 # There were 1 successful branch saturations after the branch.
% 0.21/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.42 # Begin clausification derivation
% 0.21/0.42
% 0.21/0.42 # End clausification derivation
% 0.21/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.42 cnf(i_0_13, plain, (c_in(X1,c_insert(X1,X2,X3),X3))).
% 0.21/0.42 cnf(i_0_18, negated_conjecture, (~c_lessequals(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)))).
% 0.21/0.42 cnf(i_0_11, plain, (c_lessequals(c_Message_Osynth(X1),c_Message_Osynth(X2),tc_set(tc_Message_Omsg))|~c_lessequals(X1,X2,tc_set(tc_Message_Omsg)))).
% 0.21/0.42 cnf(i_0_10, plain, (c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)|~c_in(X1,X2,tc_Message_Omsg))).
% 0.21/0.42 cnf(i_0_17, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3))).
% 0.21/0.42 cnf(i_0_16, plain, (c_lessequals(X1,X2,tc_set(X3))|c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3))).
% 0.21/0.42 cnf(i_0_12, plain, (c_in(X1,c_insert(X2,X3,X4),X4)|~c_in(X1,X3,X4))).
% 0.21/0.42 cnf(i_0_14, plain, (X1=X2|c_in(X1,X3,X4)|~c_in(X1,c_insert(X2,X3,X4),X4))).
% 0.21/0.42 cnf(i_0_15, plain, (c_in(X1,X2,X3)|~c_lessequals(X4,X2,tc_set(X3))|~c_in(X1,X4,X3))).
% 0.21/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.42 # Begin printing tableau
% 0.21/0.42 # Found 4 steps
% 0.21/0.42 cnf(i_0_18, negated_conjecture, (~c_lessequals(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))), inference(start_rule)).
% 0.21/0.42 cnf(i_0_19, plain, (~c_lessequals(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))), inference(extension_rule, [i_0_16])).
% 0.21/0.42 cnf(i_0_27, plain, (c_in(c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg)), inference(extension_rule, [i_0_10])).
% 0.21/0.42 cnf(i_0_38, plain, (c_in(c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg)),tc_Message_Omsg)), inference(etableau_closure_rule, [i_0_38, ...])).
% 0.21/0.42 # End printing tableau
% 0.21/0.42 # SZS output end
% 0.21/0.42 # Branches closed with saturation will be marked with an "s"
% 0.21/0.42 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.42 # We now have 2 tableaux to operate on
% 0.21/0.42 # Found closed tableau during pool population.
% 0.21/0.42 # Proof search is over...
% 0.21/0.42 # Freeing feature tree
%------------------------------------------------------------------------------