%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COM011-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 : n029.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 : Fri Jul 15 01:14:56 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 : COM011-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.12/0.34 % Computer : n029.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Thu Jun 16 17:37:27 EDT 2022 % 0.12/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: 10 Number of unprocessed: 10 % 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 # 10 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 3 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 # 7 extension rule candidate clauses % 0.19/0.37 # 3 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 # There were 2 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 2 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 2 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_12, negated_conjecture, (c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)))). % 0.19/0.37 cnf(i_0_11, negated_conjecture, (c_in(v_F,c_UNITY_Oconstrains(v_A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)))). % 0.19/0.37 cnf(i_0_13, negated_conjecture, (~c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)))). % 0.19/0.37 cnf(i_0_14, plain, (c_in(X1,X2,X3)|~c_in(X1,c_minus(X2,X4,tc_set(X3)),X3))). % 0.19/0.37 cnf(i_0_16, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3))). % 0.19/0.37 cnf(i_0_15, plain, (c_lessequals(X1,X2,tc_set(X3))|c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3))). % 0.19/0.37 cnf(i_0_19, plain, (c_in(X1,c_WFair_OleadsTo(X2,X3,X4),tc_UNITY_Oprogram(X4))|~c_in(X1,c_WFair_Oensures(X2,X3,X4),tc_UNITY_Oprogram(X4)))). % 0.19/0.37 cnf(i_0_20, plain, (c_in(X1,c_WFair_Otransient(X2,X3),tc_UNITY_Oprogram(X3))|~c_lessequals(X2,X4,tc_set(X3))|~c_in(X1,c_WFair_Otransient(X4,X3),tc_UNITY_Oprogram(X3)))). % 0.19/0.37 cnf(i_0_17, plain, (c_in(X1,c_UNITY_Oconstrains(X2,X3,X4),tc_UNITY_Oprogram(X4))|~c_lessequals(X2,X5,tc_set(X4))|~c_in(X1,c_UNITY_Oconstrains(X5,X3,X4),tc_UNITY_Oprogram(X4)))). % 0.19/0.37 cnf(i_0_18, plain, (c_in(X1,c_WFair_Oensures(X2,X3,X4),tc_UNITY_Oprogram(X4))|~c_in(X1,c_UNITY_Oconstrains(c_minus(X2,X3,tc_set(X4)),c_union(X2,X3,X4),X4),tc_UNITY_Oprogram(X4))|~c_in(X1,c_WFair_Otransient(c_minus(X2,X3,tc_set(X4)),X4),tc_UNITY_Oprogram(X4)))). % 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 7 steps % 0.19/0.37 cnf(i_0_12, negated_conjecture, (c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a))), inference(start_rule)). % 0.19/0.37 cnf(i_0_23, plain, (c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a))), inference(extension_rule, [i_0_20])). % 0.19/0.37 cnf(i_0_66, plain, (c_in(v_F,c_WFair_Otransient(c_minus(v_A,v_B,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a))), inference(extension_rule, [i_0_18])). % 0.19/0.37 cnf(i_0_89, plain, (c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a))), inference(extension_rule, [i_0_19])). % 0.19/0.37 cnf(i_0_166, plain, (c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a))), inference(closure_rule, [i_0_13])). % 0.19/0.37 cnf(i_0_90, plain, (~c_in(v_F,c_UNITY_Oconstrains(c_minus(v_A,v_B,tc_set(t_a)),c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a))), inference(etableau_closure_rule, [i_0_90, ...])). % 0.19/0.37 cnf(i_0_67, plain, (~c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a))), inference(etableau_closure_rule, [i_0_67, ...])). % 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 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 6 tableaux to operate on % 0.19/0.37 # Found closed tableau during pool population. % 0.19/0.37 # Proof search is over... % 0.19/0.37 # Freeing feature tree %------------------------------------------------------------------------------