%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL106-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 : n021.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 00:24:55 EDT 2022 % Result : Unsatisfiable 0.43s 0.60s % Output : CNFRefutation 0.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : COL106-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.35 % Computer : n021.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Tue May 31 05:57:29 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 12 Number of unprocessed: 12 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 12 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 2 conjectures. % 0.13/0.38 # There are 2 start rule candidates: % 0.13/0.38 # Found 4 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 2 start rule tableaux created. % 0.13/0.38 # 8 extension rule candidate clauses % 0.13/0.38 # 4 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 2 % 0.43/0.60 # There were 4 total branch saturation attempts. % 0.43/0.60 # There were 0 of these attempts blocked. % 0.43/0.60 # There were 0 deferred branch saturation attempts. % 0.43/0.60 # There were 0 free duplicated saturations. % 0.43/0.60 # There were 4 total successful branch saturations. % 0.43/0.60 # There were 0 successful branch saturations in interreduction. % 0.43/0.60 # There were 0 successful branch saturations on the branch. % 0.43/0.60 # There were 4 successful branch saturations after the branch. % 0.43/0.60 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.43/0.60 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.43/0.60 # Begin clausification derivation % 0.43/0.60 % 0.43/0.60 # End clausification derivation % 0.43/0.60 # Begin listing active clauses obtained from FOF to CNF conversion % 0.43/0.60 cnf(i_0_13, negated_conjecture, (c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x),v_ya),v_xb,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)))). % 0.43/0.60 cnf(i_0_22, plain, (c_in(c_Pair(X1,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)))). % 0.43/0.60 cnf(i_0_23, plain, (c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,X1),X2),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)))). % 0.43/0.60 cnf(i_0_17, plain, (c_Comb_Ocomb_Oop_A_D_D(X1,X2)!=c_Comb_Ocomb_OK)). % 0.43/0.60 cnf(i_0_14, negated_conjecture, (~c_in(c_Pair(v_x,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))|~c_in(c_Pair(v_xb,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)))). % 0.43/0.60 cnf(i_0_19, plain, (X1=X2|c_Comb_Ocomb_Oop_A_D_D(X3,X1)!=c_Comb_Ocomb_Oop_A_D_D(X4,X2))). % 0.43/0.60 cnf(i_0_18, plain, (X1=X2|c_Comb_Ocomb_Oop_A_D_D(X1,X3)!=c_Comb_Ocomb_Oop_A_D_D(X2,X4))). % 0.43/0.60 cnf(i_0_20, plain, (c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_sko__uTE(X1,X2))=X2|~c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,X1),X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)))). % 0.43/0.60 cnf(i_0_21, plain, (c_in(c_Pair(X1,v_sko__uTE(X1,X2),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))|~c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,X1),X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)))). % 0.43/0.60 cnf(i_0_24, plain, (c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(X1,X2),c_Comb_Ocomb_Oop_A_D_D(X3,X4),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))|~c_in(c_Pair(X1,X3,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))|~c_in(c_Pair(X2,X4,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)))). % 0.43/0.60 cnf(i_0_15, plain, (c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OS,v_sko__uTF(X1,X2,X3)),v_sko__uTG(X1,X2,X3))=X1|c_Comb_Ocomb_Oop_A_D_D(v_sko__uTI(X1,X2,X3),v_sko__uTH(X1,X2,X3))=X3|X1=c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,X3)|X3=c_Comb_Ocomb_Oop_A_D_D(X1,X2)|~c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(X1,X2),X3,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)))). % 0.43/0.60 cnf(i_0_16, plain, (c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OS,v_sko__uTF(X1,X2,X3)),v_sko__uTG(X1,X2,X3))=X1|X1=c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,X3)|X3=c_Comb_Ocomb_Oop_A_D_D(X1,X2)|c_in(c_Pair(X1,v_sko__uTI(X1,X2,X3),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))|~c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(X1,X2),X3,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)))). % 0.43/0.60 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.43/0.60 # Begin printing tableau % 0.43/0.60 # Found 7 steps % 0.43/0.60 cnf(i_0_13, negated_conjecture, (c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x),v_ya),v_xb,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))), inference(start_rule)). % 0.43/0.60 cnf(i_0_27, plain, (c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x),v_ya),v_xb,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))), inference(extension_rule, [i_0_16])). % 0.43/0.60 cnf(i_0_67, plain, (c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OS,v_sko__uTF(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x),v_ya,v_xb)),v_sko__uTG(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x),v_ya,v_xb))=c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x)), inference(extension_rule, [i_0_19])). % 0.43/0.60 cnf(i_0_68, plain, (c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_xb)=c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x)), inference(etableau_closure_rule, [i_0_68, ...])). % 0.43/0.60 cnf(i_0_69, plain, (c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x),v_ya)=v_xb), inference(etableau_closure_rule, [i_0_69, ...])). % 0.43/0.60 cnf(i_0_70, plain, (c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x),v_sko__uTI(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x),v_ya,v_xb),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))), inference(etableau_closure_rule, [i_0_70, ...])). % 0.43/0.60 cnf(i_0_74, plain, (v_sko__uTG(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x),v_ya,v_xb)=v_x), inference(etableau_closure_rule, [i_0_74, ...])). % 0.43/0.60 # End printing tableau % 0.43/0.60 # SZS output end % 0.43/0.60 # Branches closed with saturation will be marked with an "s" % 0.43/0.60 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.43/0.60 # We now have 4 tableaux to operate on % 0.43/0.60 # Found closed tableau during pool population. % 0.43/0.60 # Proof search is over... % 0.43/0.60 # Freeing feature tree %------------------------------------------------------------------------------