%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV001-1 : TPTP v8.1.0. Released v1.0.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 : n008.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:18:52 EDT 2022 % Result : Unsatisfiable 0.13s 0.38s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWV001-1 : TPTP v8.1.0. Released v1.0.0. % 0.06/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 : n008.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 : Tue Jun 14 23:22:52 EDT 2022 % 0.13/0.34 % 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: 14 Number of unprocessed: 14 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 14 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 3 conjectures. % 0.13/0.37 # There are 3 start rule candidates: % 0.13/0.37 # Found 2 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 3 start rule tableaux created. % 0.13/0.37 # 12 extension rule candidate clauses % 0.13/0.37 # 2 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.13/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 10 tableaux to operate on % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # There were 2 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 2 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 2 successful branch saturations after the branch. % 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_26, negated_conjecture, (q1(a,b,c))). % 0.13/0.38 cnf(i_0_21, plain, (less_or_equalish(X1,X1))). % 0.13/0.38 cnf(i_0_27, negated_conjecture, (~q4(a,b,X1)|~less_or_equalish(X1,a)|~less_or_equalish(a,X1)|~less_or_equalish(b,X1))). % 0.13/0.38 cnf(i_0_28, negated_conjecture, (~q4(a,b,X1)|~less_or_equalish(X1,b)|~less_or_equalish(a,X1)|~less_or_equalish(b,X1))). % 0.13/0.38 cnf(i_0_25, plain, (less_or_equalish(X1,X2)|~equalish(X1,X2))). % 0.13/0.38 cnf(i_0_24, plain, (less_or_equalish(X1,X2)|less_or_equalish(X2,X1))). % 0.13/0.38 cnf(i_0_22, plain, (equalish(X1,X2)|~less_or_equalish(X2,X1)|~less_or_equalish(X1,X2))). % 0.13/0.38 cnf(i_0_19, plain, (q4(X1,X2,X2)|~q2(X1,X2,X3))). % 0.13/0.38 cnf(i_0_20, plain, (q4(X1,X2,X1)|~q3(X1,X2,X3))). % 0.13/0.38 cnf(i_0_16, plain, (less_or_equalish(X1,X2)|~less_or_equalish(X1,X3)|~equalish(X3,X2))). % 0.13/0.38 cnf(i_0_15, plain, (less_or_equalish(X1,X2)|~less_or_equalish(X3,X2)|~equalish(X3,X1))). % 0.13/0.38 cnf(i_0_23, plain, (less_or_equalish(X1,X2)|~less_or_equalish(X3,X2)|~less_or_equalish(X1,X3))). % 0.13/0.38 cnf(i_0_17, plain, (q2(X1,X2,X3)|~q1(X1,X2,X3)|~less_or_equalish(X1,X2))). % 0.13/0.38 cnf(i_0_18, plain, (q3(X1,X2,X3)|less_or_equalish(X1,X2)|~q1(X1,X2,X3))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 5 steps % 0.13/0.38 cnf(i_0_26, negated_conjecture, (q1(a,b,c)), inference(start_rule)). % 0.13/0.38 cnf(i_0_37, plain, (q1(a,b,c)), inference(extension_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_126, plain, (q2(a,b,c)), inference(extension_rule, [i_0_19])). % 0.13/0.38 cnf(i_0_128, plain, (~less_or_equalish(a,b)), inference(etableau_closure_rule, [i_0_128, ...])). % 0.13/0.38 cnf(i_0_136, plain, (q4(a,b,b)), inference(etableau_closure_rule, [i_0_136, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Child (32738) has found a proof. % 0.13/0.38 % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------